Journal ArticleDOI
A fast algorithm for Steiner trees
Reads0
Chats0
TLDR
The heuristic algorithm has a worst case time complexity of O(¦S¦¦V¦2) on a random access computer and it guarantees to output a tree that spans S with total distance on its edges no more than 2(1−1/l) times that of the optimal tree.Abstract:
Given an undirected distance graph G=(V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbers and S?V is a subset of the vertices of V, the Steiner tree problem is to find a tree of G that spans S with minimal total distance on its edges. In this paper, we analyze a heuristic algorithm for the Steiner tree problem. The heuristic algorithm has a worst case time complexity of O(¦S¦¦V¦ 2) on a random access computer and it guarantees to output a tree that spans S with total distance on its edges no more than 2(1?1/l) times that of the optimal tree, where l is the number of leaves in the optimal tree.read more
Citations
More filters
Proceedings ArticleDOI
A QoS-aware multicast routing protocol for multimedia applications in mobile ad hoc networks
TL;DR: A new QoS-aware Multicast Overlay Spanning Tree (QMOST) protocol is proposed to support multiple-metric routing criteria in mobile ad hoc networks and computes low cost trees under various QoS constraints in polynomial time using an efficient source-based optimization heuristic.
Journal ArticleDOI
A Distributed Routing Method for Dynamic Multicasting
TL;DR: A destination driven algorithm to minimize the total tree cost of multicast tree in a dynamic situation for the whole session duration in this heuristic approach considered the staying duration of participants are available at the time of joining.
Design of power efficient multicast algorithms for sparse split WDM networks
TL;DR: This thesis deals with the important issue of Power Efficient multicast in WDM optical networks and reports three new algorithms for constructing power efficient multicast trees and forests, the first to take into account all possible sources of power losses while constructing the trees.
Proceedings Article
On the Number of MPLS LSPs using Multicast Tree Aggregation
TL;DR: In this article, the impact of tree aggregation algorithms on the performance of multicast tree aggregation protocols is investigated, and it is shown that the number of trees that need to be configured in a domain depends on the tree construction algorithm.
Proceedings ArticleDOI
Multicast routing in heterogeneous wireline/wireless environments
Tae-Eun Kim,V. Bharghavan +1 more
TL;DR: The BTLA uses the base tree approach in dynamic regions and refines it with the link augmentation approach in stable regions to reduce the latency and overhead of joins, leaves, and handoffs.
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.
Book ChapterDOI
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
Reducibility Among Combinatorial Problems.
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
Journal ArticleDOI
Algorithm 97: Shortest path
TL;DR: The procedure was originally programmed in FORTRAN for the Control Data 160 desk-size computer and was limited to te t ra t ion because subroutine recursiveness in CONTROL Data 160 FORTRan has been held down to four levels in the interests of economy.
Journal ArticleDOI
Steiner Minimal Trees
E. N. Gilbert,H. O. Pollak +1 more
TL;DR: A Steiner minimal tree for given points in the plane is a tree which interconnects these points using lines of shortest possible total length as mentioned in this paper, where the length of the shortest possible line is chosen.