An improved approximation scheme for the group Steiner problem

Networks

Volumn 37, Issue 1, 2001, Pages 8-20

  Helvig, C S ^a   Robins, Gabriel ^a   Zelikovsky, Alexander ^b  

^a University of Virginia   (United States)

^b GEORGIA STATE UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Arborescences; Combinatorial optimization; Graph algorithms; Group Steiner problem; Steiner problem; Steiner trees

Indexed keywords

EID: 0035218510     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200101)37:1<8::AID-NET2>3.0.CO;2-R     Document Type: Article

References (24)

1. [1] M.J. Alexander and G. Robins, New performance-driven fpga routing algorithms, IEEE Trans Computer-Aided Design 15 (1996), 1505-1517.
2. [2] C.J. Alpert, T.C. Hu, J.H. Huang, and A.B. Kahng, A direct combination of the Prim and Dijkstra constructions for improved performance-driven global routing, Proc IEEE Int Symp Circuits and Systems, Chicago, IL, May 1993, pp. 1869-1872.
3. [3] B. Awerbuch, A. Baratz, and D. Peleg, Cost-sensitive analysis of communication protocols, Proc ACM Symp Principles of Distributed Computing, 1990, pp. 177-187.
4. [4] C.D. Bateman, C.S. Helvig, G. Robins, and A. Zelikovsky, Provably-good routing tree construction with multi-port terminals, Proc Int Symp on Physical Design, Napa Valley, CA, April 1997, pp. 96-102.
5. [5] P. Berman and V. Ramaiyer, Improved approximations for the Steiner tree problem. Proc ACM/SIAM Symp Discrete Algorithms, San Francisco, CA, Jan. 1992, pp. 325-334.
6. [6] J. Cong, A.B. Kahng, G. Robins, M. Sarrafzadeh, and C.K. Wong, Provably good performance-driven global routing, IEEE Trans Comput-Aided Design, 11 (1992), 739-752.
7. [7] U. Feige, A threshold of ln n for approximating set cover, Proc ACM Symp on the Theory of Computing, May 1996, pp. 314-318.
8. [8] J. Griffith, G. Robins, J.S. Salowe, and T. Zhang, Closing the gap: Near-optimal Steiner trees in polynomial time, IEEE Trans Comput-Aided Design 13 (1994), 1351-1365.
9. [9] C.S. Helvig, G. Robins, and A. Zelikovsky, Improved approximation bounds for the group Steiner problem, Proc Conf on Design Automation and Test in Europe, Paris, France, Feb. 1998, pp. 406-413.
10. [10] F.K. Hwang, D.S. Richards, and P. Winter, The Steiner tree problem, North-Holland, Amsterdam, 1992.
11. [11] E. Ihler, Bounds on the quality of approximate solutions to the group Steiner problem, Lecture notes in computer science, Springer Verlag, 1991, Vol. 484, pp. 109-118.
12. [12] E. Ihler, The complexity of approximating the class Steiner tree problem, Technical report, Institut für Informatik, Universität Freiburg, 1991.
13. [13] A.B. Kahng and G. Robins, A new class of iterative Steiner tree heuristics with good performance, IEEE Trans Computer-Aided Design 11 (1992), 893-902.
14. [14] A.B. Kahng and G. Robins, On optimal interconnections for VLSI, Kluwer, Boston, MA, 1995.
15. [15] S. Khuller, B. Raghavachari, and N. Young, Balancing minimum spanning and shortest path trees, Proc ACM/SIAM Symp Discrete Algorithms, Jan. 1993, pp. 243-250.
16. [16] L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees, Acta Info 15 (1981), 141-145.
17. [17] E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, The traveling salesman problem: A guided tour of combinatorial optimization, Wiley, Chichester, New York, 1985.
18. [18] B.T. Preas and M.J. Lorenzetti, Physical design automation of VLSI systems, Benjamin/Cummings, Menlo Park, CA, 1988.
19. [19] G. Reich and P. Widmayer, Beyond Steiner's problem: A vlsi oriented generalization, Lecture notes in computer science, Springer Verlag, 1989, Vol. 411, pp. 196-211.
20. [20] G. Reinelt, The traveling salesman: computational solutions for TSP applications, Springer-Verlag, Berlin, Germany, 1994.
21. [21] H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math Jpn 24 (1980), 573-577.
22. [22] A.Z. Zelikovsky, An 11/6 approximation algorithm for the network Steiner problem, Algorithmica 9 (1993), 463-470.
23. [23] A.Z. Zelikovsky, A faster approximation algorithm for the Steiner tree problem in graphs, Info Process Lett 46(2) (1993), 79-83.
24. [24] A.Z. Zelikovsky, A series of approximation algorithms for the acyclic directed Steiner tree problem, Algorithmica 18 (1997), 99-110.