Relevant bibliographies by topics / Optimum communication spanning tree

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers
  5. Reports

Academic literature on the topic 'Optimum communication spanning tree'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Optimum communication spanning tree.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Optimum communication spanning tree"

1

Zetina, Carlos Armando, Ivan Contreras, Elena Fernández, and Carlos Luna-Mota. "Solving the optimum communication spanning tree problem." European Journal of Operational Research 273, no. 1 (2019): 108–17. http://dx.doi.org/10.1016/j.ejor.2018.07.055.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sharma, Prabha. "Algorithms for the optimum communication spanning tree problem." Annals of Operations Research 143, no. 1 (2006): 203–9. http://dx.doi.org/10.1007/s10479-006-7382-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wu, Bang Ye, Kun-Mao Chao, and Chuan Yi Tang. "Approximation algorithms for some optimum communication spanning tree problems." Discrete Applied Mathematics 102, no. 3 (2000): 245–66. http://dx.doi.org/10.1016/s0166-218x(99)00212-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Fernández, Elena, Carlos Luna-Mota, Achim Hildenbrandt, Gerhard Reinelt, and Stefan Wiesberg. "A Flow Formulation for the Optimum Communication Spanning Tree." Electronic Notes in Discrete Mathematics 41 (June 2013): 85–92. http://dx.doi.org/10.1016/j.endm.2013.05.079.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Contreras, Ivan, Elena Fernández, and Alfredo Marín. "Lagrangean bounds for the optimum communication spanning tree problem." TOP 18, no. 1 (2009): 140–57. http://dx.doi.org/10.1007/s11750-009-0112-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ahuja, R. K., and V. V. S. Murty. "Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem." Transportation Science 21, no. 3 (1987): 163–70. http://dx.doi.org/10.1287/trsc.21.3.163.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Anazawa, Tsutomu, Takayuki Kodera, and Masakazu Jimbo. "Optimum requirement spanning trees and reliability of tree networks." Networks 34, no. 2 (1999): 122–31. http://dx.doi.org/10.1002/(sici)1097-0037(199909)34:2<122::aid-net5>3.0.co;2-p.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

El-Mallah, Ehab S., and Charles J. Colbourn. "Optimum Communication Spanning Trees in Series-Parallel Networks." SIAM Journal on Computing 14, no. 4 (1985): 915–25. http://dx.doi.org/10.1137/0214064.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rothlauf, Franz. "On Optimal Solutions for the Optimal Communication Spanning Tree Problem." Operations Research 57, no. 2 (2009): 413–25. http://dx.doi.org/10.1287/opre.1080.0592.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Agarwal, Yogesh Kumar, and Prahalad Venkateshan. "New Valid Inequalities for the Optimal Communication Spanning Tree Problem." INFORMS Journal on Computing 31, no. 2 (2019): 268–84. http://dx.doi.org/10.1287/ijoc.2018.0827.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Optimum communication spanning tree"

1

Luna, Mota Carlos. "The Optimum Communication Spanning Tree Problem : properties, models and algorithms." Doctoral thesis, Universitat Politècnica de Catalunya, 2016. http://hdl.handle.net/10803/387546.

Full text
Abstract:
For a given cost matrix and a given communication requirement matrix, the OCSTP is defined as finding a spanning tree that minimizes the operational cost of the network. OCST can be used to design of more efficient communication and transportation networks, but appear also, as a subproblem, in hub location and sequence alignment problems. This thesis studies several mixed integer linear optimization formulations of the OCSTP and proposes a new one. Then, an efficient Branch & Cut algorithm derived from the Benders decomposition of one of such formulations is used to successfully solve medium-
APA, Harvard, Vancouver, ISO, and other styles
2

Ravelo, Santiago Valdes. "Problema da árvore geradora de comunicação ótima: variantes, complexidade e aproximação." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-12042016-145246/.

Full text
Abstract:
O problema da árvore geradora de comunicação ótima recebe um grafo com comprimentos não negativos nas arestas e um requerimento não negativo entre cada par de vértices; sendo o objetivo encontrar uma árvore geradora do grafo que minimize o custo de comunicação, que é a soma sobre cada par de vértice da distância entre eles na árvore vezes o requerimento entre eles. Este problema é NP-difícil, assim como vários casos particulares dele. Neste trabalho estudamos algumas variantes deste problema, introduzimos novos casos particulares que são também NP-difíceis e propomos esquemas de aproximação
APA, Harvard, Vancouver, ISO, and other styles
3

Lindström, Henrik. "Migration to P4-Programmable Switches and Implementation of the Rapid Spanning Tree Protocol." Thesis, Linköpings universitet, Programvara och system, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-167509.

Full text
Abstract:
P4 is a high-level language for programming the data plane of a network switch. These P4-programmable switches come with no pre-defined behavior or protocols, so it is entirely up to the loaded P4 program to define these. This allows the user to exclude any unwanted functionality and to create custom protocols. It also removes the dependence on the switch vendor in terms of both trust and addition of new features. This thesis looks at migration from traditional switches to P4-programmable ones. Since no behavior is included out-of-the-box in the P4 switches, a search is made for open-source P4
APA, Harvard, Vancouver, ISO, and other styles
4

Sehgal, Rahul. "Greedy routing in a graph by aid of its spanning tree experimental results and analysis /." [Kent, Ohio] : Kent State University, 2009. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=kent1232166476.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Araujo, João Paulo de. "A communication-efficient causal broadcast publish/subscribe system." Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS081.

Full text
Abstract:
La Publication/Abonnement (Publish/Subscribe, Pub/Sub) est un paradigme qui permet aux nœuds d'un système distribué de diffuser des informations de manière asynchrone. Cette thèse s'intéresse aux systèmes de Pub/Sub basés sur des sujets (topic-based), en adressant les problèmes de performances et de contention existant dans plusieurs approches reposant sur des arbres. Les solutions proposées utilisent la construction d'arbres couvrants regroupant les abonnés et dont les racines sont les émetteurs. Les arbres associés à différentes sources sont organisés différemment. La première contribution d
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Optimum communication spanning tree"

1

Wu, Bang Ye, Kun-Mao Chao, and Chuan Yi Tang. "Approximation Algorithms for Some Optimum Communication Spanning Tree Problems." In Algorithms and Computation. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-49381-6_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rothlauf, Franz. "Optimal Communication Spanning Tree Test Instances." In Representations for Genetic and Evolutionary Algorithms. Physica-Verlag HD, 2002. http://dx.doi.org/10.1007/978-3-642-88094-0_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hiep, Nguyen Duy, and Huynh Thi Thanh Binh. "Improved Genetic Algorithm for Solving Optimal Communication Spanning Tree Problem." In Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-37502-6_49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Yu, and Youcef Bouchebaba. "A New Genetic Algorithm for the Optimal Communication Spanning Tree Problem." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/10721187_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Izumi, Taisuke. "Randomized Lower Bound for Distributed Spanning-Tree Verification." In Structural Information and Communication Complexity. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09620-9_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Domagała, Wojciech. "Spanning Tree Protocol in Wireless Industrial Communication System." In Computer Networks. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13861-4_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Isha Singh, Bharti Sharma, and Awadhesh Kumar Singh. "On the Dynamic Maintenance of Spanning Tree." In Proceedings of the International Congress on Information and Communication Technology. Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-0755-2_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Cournier, Alain. "A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm." In Structural Information and Communication Complexity. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11476-2_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sandhu, Sabhijiit Singh, B. K. Tripathy, and Shivansh Jagga. "KMST+: A K-Means++-Based Minimum Spanning Tree Algorithm." In Smart Innovations in Communication and Computational Sciences. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-8968-8_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ravelo, Santiago V., and Carlos E. Ferreira. "PTAS’s for Some Metric p-source Communication Spanning Tree Problems." In WALCOM: Algorithms and Computation. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-15612-5_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Optimum communication spanning tree"

1

Adler, Micah, Wolfgang Dittrich, Ben Juurlink, Mirosław Kutyłowski, and Ingo Rieping. "Communication-optimal parallel minimum spanning tree algorithms (extended abstract)." In the tenth annual ACM symposium. ACM Press, 1998. http://dx.doi.org/10.1145/277651.277662.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Steitz, Wolfgang, and Franz Rothlauf. "Guided local search for the optimal communication spanning tree problem." In the 13th annual conference companion. ACM Press, 2011. http://dx.doi.org/10.1145/2001858.2001889.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kien, Pham Trung, Nguyen Duy Hiep, and Huynh Thi Thanh Binh. "New hybrid genetic algorithm for solving optimal communication spanning tree problem." In the 2011 ACM Symposium. ACM Press, 2011. http://dx.doi.org/10.1145/1982185.1982421.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hoang, Anh Tuan, Vinh Trong Le, and Nhu Gia Nguyen. "A Novel Particle Swarm Optimization-Based Algorithm for the Optimal Communication Spanning Tree Problem." In 2010 Second International Conference on Communication Software and Networks. IEEE, 2010. http://dx.doi.org/10.1109/iccsn.2010.111.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Shie-Yuan, Chia-Cheng Wu, and Chih-Liang Chou. "Constructing an optimal spanning tree over a hybrid network with SDN and legacy switches." In 2015 20th IEEE Symposium on Computers and Communication (ISCC). IEEE, 2015. http://dx.doi.org/10.1109/iscc.2015.7405564.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Arora, Sakshi, and M. L. Garg. "Clustering the Data Points to Obtain Optimum Backbones for the Bounded Diameter Minimum Spanning Trees." In 2011 International Conference on Communication Systems and Network Technologies (CSNT). IEEE, 2011. http://dx.doi.org/10.1109/csnt.2011.164.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sommer, Jorg. "On optimal communication spanning trees in embedded Ethernet networks." In 2010 8th IEEE International Workshop on Factory Communication Systems - (WFCS 2010). IEEE, 2010. http://dx.doi.org/10.1109/wfcs.2010.5548629.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Changjin Suh, Jisoo Shin, and Jaesung Lee. "Fusion rate based Spanning Tree." In 2008 11th IEEE Singapore International Conference on Communication Systems (ICCS). IEEE, 2008. http://dx.doi.org/10.1109/iccs.2008.4737475.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Mosbah, Mustafa, Salem Arif, Ridha Djamel Mohammedi, and Abdelhafid Hellal. "Optimum dynamic distribution network reconfiguration using minimum spanning tree algorithm." In 2017 5th International Conference on Electrical Engineering - Boumerdes (ICEE-B). IEEE, 2017. http://dx.doi.org/10.1109/icee-b.2017.8192170.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Suh, Changjin, Kyungmi Kim, and Jisoo Shin. "ENDIST: Edge Node Divided Spanning Tree." In 2008 10th International Conference on Advanced Communication Technology. IEEE, 2008. http://dx.doi.org/10.1109/icact.2008.4493877.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Optimum communication spanning tree"

1

Zhang, M., H. Wen, and J. Hu. Spanning Tree Protocol (STP) Application of the Inter-Chassis Communication Protocol (ICCP). RFC Editor, 2016. http://dx.doi.org/10.17487/rfc7727.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography