Journal ArticleDOI
A fast algorithm for computing minimum routing cost spanning trees
Rui Campos,Manuel Ricardo +1 more
TLDR
This work proposes a new approximation Minimum Routing Cost Tree algorithm that has time complexity lower than the fastest known approximation algorithm and provides a spanning tree with the same routing cost in practice.About:
This article is published in Computer Networks.The article was published on 2008-12-01. It has received 40 citations till now. The article focuses on the topics: Minimum spanning tree & Spanning tree.read more
Citations
More filters
Proceedings ArticleDOI
Random graphs
TL;DR: Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Journal ArticleDOI
An artificial bee colony algorithm for the minimum routing cost spanning tree problem
Alok Singh,Shyam Sundar +1 more
TL;DR: An artificial bee colony (ABC) algorithm-based approach is proposed for the minimum routing cost spanning tree problem and is compared against four best methods reported in the literature—two genetic algorithms, a stochastic hill climber and a perturbation-based local search.
Proceedings ArticleDOI
Efficient content-based routing with network topology inference
TL;DR: A novel approach that exploits the knowledge of event traffic, user subscriptions and topology of the underlying physical network to perform efficient routing in a publish/subscribe system and yields a significant reduction in routing cost in comparison to the state of the art.
Journal ArticleDOI
Genetic algorithms to balanced tree structures in graphs
Riham Moharam,Ehab Morsy +1 more
TL;DR: Efficient genetic algorithms are presented that return high quality solutions for the related balanced tree structure problems in G that are NP-hard.
Journal ArticleDOI
Original Article: An efficient method to solve least-cost minimum spanning tree (LC-MST) problem
TL;DR: The presented algorithm can be modified to solve the DC-MST (Delay Constrained-Minimum Spanning Tree) problem presented by Lee and Atiquzzaman (2007) and the MRCT (Minimum Routing Cost Tree)problem presented by Cambos and Ricardo (2008), given as the applications of the presented algorithm.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
The capacity of wireless networks
Piyush Gupta,P. R. Kumar +1 more
TL;DR: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits persecond under a noninterference protocol.
Proceedings ArticleDOI
Random graphs
TL;DR: Some of the major results in random graphs and some of the more challenging open problems are reviewed, including those related to the WWW.
Journal ArticleDOI
On the shortest spanning subtree of a graph and the traveling salesman problem
TL;DR: Kurosh and Levitzki as discussed by the authors, on the radical of a general ring and three problems concerning nil rings, Bull Amer Math Soc vol 49 (1943) pp 913-919 10 -, On the structure of algebraic algebras and related rings.
Journal ArticleDOI
Shortest connection networks and some generalizations
TL;DR: In this paper, the basic problem of interconnecting a given set of terminals with a shortest possible network of direct links is considered, and a set of simple and practical procedures are given for solving this problem both graphically and computationally.