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
ESM: efficient and scalable data center multicast routing
TL;DR: Simulations show that ESM saves 40% ~ 50% network traffic and doubles the application throughputs compared to receiver-driven multicast routing, and the combination routing scheme significantly reduces the number of in-switch entries required.
Journal ArticleDOI
An integrated CAD system for algorithm-specific IC design
C.B. Shung,Rajeev Jain,K. Rimey,E. Wang,Mani Srivastava,Brian Richards,E. Lettang,S. Khalid Azim,L. Thon,P.N. Hilfinger,Jan M. Rabaey,Robert W. Brodersen +11 more
TL;DR: LAGER is an integrated computer-aided design system for algorithm-specific integrated circuit design, targeted at applications such as speech processing, image processing, telecommunications, and robot control, and allows easy integration of novel CAD tools.
Journal ArticleDOI
Path-distance heuristics for the Steiner problem in undirected networks
Pawel Winter,J. MacGregor Smith +1 more
TL;DR: It is shown that two of these repetitive SPH variants generate solutions that in general are better than solutions obtained by any single-pass heuristic.
Journal ArticleDOI
Intra- and inter-domain multicast routing protocols: A survey and taxonomy
TL;DR: This taxonomy will be used to classify a surveyed set of intra- and inter-domain multicast routing protocols and to discuss successful protocol design regarding satisfaction of the multicast application's latency requirements as well as the network's resource consumption requirements.
Journal ArticleDOI
Destination-driven routing for low-cost multicast
Anees Shaikh,Kang G. Shin +1 more
TL;DR: A destination-driven algorithm that optimizes for applications that require multicast trees with low total cost that does not suffer from high complexity common to most Steiner tree heuristics and builds a route by querying only incident links for cost information is presented.
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.