Abstract:
The acyclic directed Steiner tree problem (ADSP) requires a minimal outward tree within an acyclic digraph with edge costs G = (V; E; d) which connects a root r with a distinguished subset S ae V, #S = k. The best possible performance guarantee of any polynomial approximation algorithm for ADSP cannot be less than 1 4 log k unless P ' NP. The presented series of heuristics A n has a performance guarantee k 1
Citations
|
515
|
Proof verification and hardness of approximation problems
– Arora, Lund, et al.
- 1992
|
|
317
|
On the hardness of approximating minimization problems
– Lund, Yannakakis
- 1994
|
|
262
|
The Steiner Tree Problem
– Hwang, Richards, et al.
- 1992
|
|
232
|
Reducibility among combinatorial problems, Complexity of Computer Computations
– Karp
- 1972
|
|
207
|
An approximate max-flow min-cut theorems for uniform multicommodity flow problem with applications to approximation algorithms
– Leighton, Rao
- 1988
|
|
174
|
An approximate solution for the Steiner problem in graphs
– Takahashi, Matsuyama
|
|
83
|
An 11/6-approximation algorithm for the network Steiner problem, Algorithmica 9
– Zelikovsky
- 1993
|
|
53
|
A nearly best-possible approximation algorithm for nodeweighted Steiner trees
– Klein, Ravi
- 1995
|
|
50
|
The computation of nearly minimal Steiner trees in graphs
– Rayward-Smith
- 1983
|
|
45
|
The Steiner problems with edge lengths 1 and 2
– Bern, Plassmann
- 1989
|
|
27
|
On better heuristic for Euclidean Steiner minimum trees
– Du, Zhang, et al.
- 1991
|
|
26
|
A method of deducing branching sequences in phylogeny. Evolution 19
– Camin, Sokal
- 1972
|
|
4
|
Cost-minimal trees in directed acyclic graphs
– Nastansky, Selkow, et al.
- 1974
|
|
4
|
Worst case-performance of Rayward-Smith's Steiner tree heuristic
– Waxman, Imase
- 1988
|
|
4
|
approximation algorithms for the network and Euclidean Steiner tree problems
– Zelikovsky, Better
- 1995
|
|
2
|
Recent developements on the approximability of combinatorial problems
– Yannakakis
- 1993
|
|
1
|
The rectilinear Steiner absorescence problem, in: Algorithmica 7
– Rao, Sadayappan, et al.
- 1992
|
|
1
|
Improved Approximation Bounds for the Rectilinear Steiner Tree Problem
– Zelikovsky, Berman, et al.
- 1994
|
|
