A series of approximation algorithms for the acyclic directed steiner tree problem
- 712 Downloads
Given an acyclic directed network, a subsetS of nodes (terminals), and a rootr, theacyclic directed Steiner tree problem requires a minimum-cost subnetwork which contains paths fromr to each terminal. It is known that unlessNP⊆DTIME[n polylogn ] no polynomial-time algorithm can guarantee better than (lnk)/4-approximation, wherek is the number of terminals. In this paper we give anO(k ε)-approximation algorithm for any ε>0. This result improves the previously knownk-approximation.
Key WordsAlgorithms Approximations Steiner tree
Unable to display preview. Download preview PDF.
- S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. InProc. 33rd Annual IEEE Symp. on Foundations of Computer Science, pp. 14–23, 1992.Google Scholar
- P. Berman, U. Fößmeier, M. Karpinski, M. Kaufmann, and A. Zelikovsky,Approaching the 5/4-Approximations for Rectilinear Steiner Trees. Lecture Notes in Computer Science, vol. 855. Springer-Verlag, Berlin, 1994, pp. 60–71.Google Scholar
- D. Z. Du, Y. Zhang, and Q. Feng. On better heuristic for Euclidean Steiner minimum trees. InProc. 32nd Annual IEEE Symp. on Foundations of Computer Science, pp. 431–439, 1991.Google Scholar
- R. M. Karp. Reducibility among combinatorial problems. In Miller and Thatcher (eds.),Complexity of Computer Computations, Plenum, New York, 1972, pp. 85–103.Google Scholar
- P. Klein and R. Ravi. A nearly best-possible approximation algorithm for node-weighted Steiner trees. InProc. Third Confer. on Integer Programming and Combinatorial Optimization, pp. 323–331, 1993.Google Scholar
- C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. InProc. 25th Annual ACM Symp. on Theory of Computing, pp. 286–293, 1993.Google Scholar
- M. Yannakakis. Recent developments on the approximability of combinatorial problems. In K. W. Nget al.(eds.),Algorithms and Computation. Lecture Notes in Computer Science, vol. 762. Springer-Verlag, Berlin, 1993, pp. 363–368.Google Scholar
- A. Z. Zelikovsky. Better approximations algorithms for the network and Euclidean Steiner tree problems. Tech. Rep. CS-96-06, University of Virginia, Charlottesville, VA.Google Scholar