Improved approximation bounds for the group Steiner problem

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 1998, Pages 406-413

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

^a University of Virginia   (United States)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION BOUNDS; GROUP STEINER PROBLEMS; JAVA IMPLEMENTATION; POLYNOMIAL-TIME; PRACTICAL PROBLEMS; ROUTING TREES; STEINER ARBORESCENCE; WEIGHTED GRAPH;

APPROXIMATION ALGORITHMS; POLYNOMIAL APPROXIMATION;

TREES (MATHEMATICS);

EID: 0007218831     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.1998.655889     Document Type: Conference Paper

References (19)

1. C. J. Alpert, T. C. Hu, J. H. Huang, and A. B. Kahng. A direct combination of the prim and dijkstra constructions for improved performancedriven global routing. In Proc. IEEE Intl. Symp. Circuits and Systems, pages 1869-1872, Chicago, IL, May 1993.
2. C. D. Bateman, C. S. Helvig, G. Robins, and A. Zelikovsky. Provably-good routing tree construction with multi-port terminals. In Proc. ACM/SIGDA International Symposium on Phys-ical Design, pages 96-102, Napa Valley, CA, April 1997.
3. P. Berman and V. Ramaiyer. Improved approximations for the steiner tree problem. In Proc. ACM/SIAM Symp. Discrete Algorithms, pages 325-334, San Francisco, CA, January 1992.
4. J. Cong, A. B. Kahng, G. Robins, M. Sarrafzadeh, and C. K. Wong. Provably good performance-driven global routing. IEEE Trans. Computer-Aided Design, 11(6):739-752, 1992.
5. U. Feige. A threshold of ln n for approximating set cover. In Proc. ACM Symp. the Theory of Computing, pages 314-318, May 1996.
6. J. Griffith, G. Robins, J. S. Salowe, and T. Zhang. Closing the gap: Near-optimal steiner trees in polynomial time. IEEE Trans. Computer-Aided Design, 13(11):1351-1365, November 1994.
7. F. K. Hwang, D. S. Richards, and P. Winter. The Steiner Tree Problem. North-Holland, 1992.
8. E. Ihler. Bounds on the quality of approximate solutions to the group steiner problem. In Lecture Notes in Computer Science, volume 484, pages 109-118, 1991.
9. E. Ihler. The complexity of approximating the class steiner tree problem. Technical report, Institut fiur Informatik, Universitiat Freiburg, 1991.
10. A. B. Kahng and G. Robins. A new class of iterative steiner tree heuristics with good performance. IEEE Trans. Computer-Aided Design, 11(7):893-902, July 1992.
11. A. B. Kahng and G. Robins. On Optimal Inter-connections for VLSI. Kluwer Academic Publishers, Boston, MA, 1995.
12. L. Kou, G. Markowsky, and L. Berman. A fast algorithm for steiner trees. Acta Informatica, 15:141-145, 1981.
13. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy, and D. B. Shmoys. The Traveling Salesman Prob-lem: a Guided Tour of Combinatorial Optimiza-tion. John Wiley and Sons, Chichester, New York, 1985.
14. B. T. Preas and M. J. Lorenzetti. Physical Design Automation of VLSI Systems. Benjamin/ Cummings, Menlo Park, CA, 1988.
15. G. Reich and P. Widmayer. Beyond steiners problem: A vlsi oriented generalization. In Lec-ture Notes in Computer Science, volume 411, pages 196-211, 1989.
16. G. Reinelt. The Traveling Salesman: Computa-tional Solutions for TSP Applications. Springer Verlag, Berlin, Germany, 1994.
17. H. Takahashi and A. Matsuyama. An approximate solution for the steiner problem in graphs. Mathematica Japonica, 24(6):573-577, 1980.
18. A. Z. Zelikovsky. An 11/6 approximation algorithm for the network steiner problem. Algorith-mica, 9:463-470, 1993.
19. A. Z. Zelikovsky. A faster approximation algorithm for the steiner tree problem in graphs. In-formation Processing Letters, 46(2):79-83, May 1993.