A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3

Journal of Algorithms

Volumn 36, Issue 1, 2000, Pages 89-101

  Prömel, Hans Jürgen ^a   Steger, Angelika ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001806503     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1086     Document Type: Article

References (23)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, in "Proc. 33rd Annual IEEE Symp. Foundations of Computer Science," pp. 14-23, 1992.
2. P. Berman and V. Ramaiyer, Improved approximations for the Steiner tree problem, J. Algorithms 17 (1994), 381-408.
3. M. Bern and P. Plassmann, The Steiner problem with edge lengths 1 and 2, Inform. Process. Lett. 32 (1989), 171-176.
4. A. Borchers and D.-Z. Du, The k-Steiner ratio in graphs, in "Proc. 27th Annual ACM Symp. on the Theory of Computing," pp. 641-649, 1995.
5. P. M. Camerini, G. Galbiati, and F. Maffioli, Random pseudo-polynomial algorithms for exact matroid problems, J. Algorithms 13 (1992), 258-273.
6. Choukhmane El-Arbi, Une heuristique pour le problème de l'arbre de Steiner, RAIRO. Rech. Opér. 12 (1978), 207-212.
7. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, in "Proc. 19th Annual ACM Symp. on Theory of Computing," pp. 1-6, 1987.
8. S. E. Dreyfus and R. A. Wagner, The Steiner problem in graphs, Networks 1 (1972), 195-207.
9. D.-Z. Du, Y.-J. Zhang, and Q. Feng, On better heuristic for Euclidean Steiner minimum trees, in "Proc. 32nd Annual IEEE Symp. on Foundations of Computer Science," pp. 431-439, 1991.
10. H. N. Gabow and M. Stallmann, An augmenting path algorithm for linear matroid parity, Combinatorics 6 (1986), 123-150.
11. R. Karp, Reducibility among combinatorial problems, in "Complexity of Computer Computations" (R. E. Miller and J. W. Thatcher, Eds.), pp. 85-103, Plenum, New York, 1972.
12. M. Karpinski and A. Z. Zelikovsky, New approximation algorithms for the Steiner tree problem, J. Comb. Optim. 1 (1997), 47-65.
13. L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees, Acta Inform. 15 (1981), 141-145.
14. S. Lang, "Algebra," Addison-Wesley, Reading, MA, 1993.
15. L. Lovász, The matroid matching problem, in "Algebraic Methods in Graph Theory," Colloquia Mathematica Societatis János Bolyai, Szeged, 1978.
16. L. Lovász, On determinants, matchings and random algorithms, Fund. Comput. Theory 79 (1979), 565-574.
17. K. Mulmuley, U. Vazirani, and V. Vazirani, Matching is as easy as matrix inversion, Combinatorica 7 (1987), 105-113.
18. H. Narayanan, H. Saran, and V. V. Vazirani, Randomized parallel algorithms for matroid union and intersection, with applications to arboreseces and edge-disjoint spanning trees, SIAM J. Comput. 23 (1994), 387-397.
19. V. Pan, Fast and efficient algorithms for the exact inversion of integer matrices, in "Fifth Annual Foundations of Software Technology and Theoretical Computer Science Conference," Lecture Notes in Computer Science, Vol. 206, pp. 504-521, Springer-Verlag, Berlin/New York, 1985.
20. H. J. Prömel and A. Steger, "The Steiner Tree Problem: A Tour through Graphs, Algorithms, and Complexity," Vieweg Verlag, Wiesbaden, 2000.
21. H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math. Japon. 24 (1980), 573-577.
22. A. Z. Zelikovsky, An 11/6-approximation algorithm for the network Steiner problem, Algorithmica 9 (1993), 463-470.
23. A. Z. Zelikovsky, Better Approximation Algorithms for the Network and Euclidean Steiner Tree Problems," Technical report, Kishinev, 1995.