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
Replacement Algorithm of Virtual Service Resources with Dynamic Resource Allocation Based on Traffic Change in Virtual Networks
Sakie Horiuchi,Takuji Tachibana +1 more
TL;DR: This paper proposes replacement algorithm of virtual service resources with dynamic resource allocation based on traffic change for mobile applications in virtual networks, and shows that the proposed method is effective when a larger number users move and the amount of traffic changes.
Proceedings ArticleDOI
A New Effective Heuristic for Solving Minimal Steiner Tree Problem on Graphs
Yan Hu,He Jiang,Zhenquan Qin +2 more
TL;DR: A new heuristic for solving STPG is proposed, which defined a novel neighborhood for local search methods and outperforms the normal MPH heuristic in solution quality.
Proceedings Article
Comparison of K-ary N-cube and de Bruijn Overlays in QoS-Constrained Multicast Applications
TL;DR: This paper focuses on two popular topologies found in interconnection networks, namely k-ary n-cubes and de Bruijn graphs, and shows how these overlay topologies compare in their ability to deliver data according to the QoS constraints of many subscribers, each receiving data from specific publishing hosts.
Proceedings ArticleDOI
A Hybrid Jumping Genes Genetic Algorithm Based Request Scheduling Approach in Multiple Destination Routing
TL;DR: A hybrid jumping genes genetic algorithm (HJGGA) for solving the request scheduling problem in multiple destination routing (MDR), that facilitates intelligent splitting of bandwidth requirement of requests as well as multiple optimal paths for transmission.
Journal ArticleDOI
A Survey of Scheduling Algorithms for the Time-Aware Shaper in Time-Sensitive Networking (TSN)
TL;DR: In this article , the authors provide a brief overview of TSN features and standards, discuss potential research directions and open problems, and explain common extensions of the TSN scheduling problem.
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.