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
An efficient IP based approach for multicast routing optimisation in multi-homing environments
Ning Wang,George Pavlou +1 more
TL;DR: This paper proposes a set of heuristic algorithms for the formulated multi-objective optimisation problem considering both intra- and inter-domain operation and shows that the proposed schemes achieve significant improvement in the relevant performance compared to conventional approaches.
Journal ArticleDOI
Real-time optimal multicast routing
TL;DR: A new path selection method that takes both cost and delay into consideration is presented that can sustain the scaling advantage of CBT without letting the delay from source to any destination exceed a real-time constraint.
Book ChapterDOI
Netzwerk-Design-Probleme
Bernhard Korte,Jens Vygen +1 more
TL;DR: In this paper, the authors discuss how man den Zusammenhang zwischen jedem Knotenpaar eines ungerichteten Graphen berechnen kann.
Book ChapterDOI
Clean-Slate Information-Centric Publish Subscribe Networks
Laura Carrea,Raul C. Almeida +1 more
TL;DR: This chapter explores a redefinition of the whole Internet architecture where nothing is taken for granted, especially IP addresses, in the EU FP7 PSIRP architecture.
Dissertation
On the Integrality Gap of Directed Steiner Tree Problem
TL;DR: A polynomial-time O(log |X|)-approximation for quasi-bipartite instances of Directed Steiner Tree is presented and bounds the integrality gap of the natural LP relaxation by the same quantity.
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.