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
Journal ArticleDOI
Tree-shared multicast in optical burst-switched WDM networks
TL;DR: It is shown that TS-MCAST outperforms S-MCast and M-UCAST in terms of bandwidth consumed and processing load (i.e., number of control packets) incurred for a given amount of multicast traffic under the same unicast traffic load with static multicast sessions and membership.
Proceedings ArticleDOI
Applicability of group communication for increased scalability in MMOGs
TL;DR: To reduce resource consumption, this work uses overlay multicast as the means of providing group communication, and research algorithms for creating shortest path trees, spanning trees, delay-bounded spanning trees and Steiner tree heuristics are investigated.
Journal ArticleDOI
Real-time multicast for wireless multihop networks
Jun Yi,Christian Poellabauer +1 more
TL;DR: Simulation results show that, compared to non-real-time multicast techniques, RTMC can provide user-specific latency management while reducing the energy consumption in the network.
Proceedings ArticleDOI
Tree-Based Protection of Multicast Services in WDM Mesh Networks
Long Long,Ahmed E. Kamal +1 more
TL;DR: The numerical results show that SPT outperforms the best existing approaches and uses less than 10% extra resources to provision a survivable multicast session over the optimal solution and has the average number of reconfigurations less than the best cost efficient approach.
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.