Class steiner trees and VLSI-design

Discrete Applied Mathematics

Volumn 90, Issue 1-3, 1999, Pages 173-194

  Ihler, Edmund ^a,d   Reich, Gabriele ^b   Widmayer, Peter ^c  

^a FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

^b Bundeswettbewerb Informatik   (Germany)

^c ETH ZURICH   (Switzerland)

^d Systor AG   (Switzerland)

Author keywords

Approximation complexity; Heuristic; MAX SNP hardness; Steiner Tree

Indexed keywords

EID: 0000996642     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00090-0     Document Type: Article

References (23)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, in: Proc. 33th Annual IEEE Symp. on Foundations of Comput. Sci., 1992, pp. 14-23.
2. M. Bellare, S. Goldwasser, C. Lund, A. Russell, Efficient probabilistically checkable proofs and applications to approximation, in: Proc. 26th Annual ACM Symp. on Theory of Computing, 1994, pp. 820-820.
3. M. Bern, P. Plassmann, The Steiner problem with edge lengths 1 and 2, Inform. Process. Lett. 32 (1989) 171-176.
4. E.W. Dijkstra, A note on two problems in connection with graphs, Numer. Math. 1(4) (1959) 269-271.
5. U. Feige, A threshold of 1n n for approximating set cover (preliminary version) in: Proc. 28th Annual ACM Symp. on Theory of Computing, 1996, pp. 314-318.
6. M.L. Fredman, R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM, 34 (1987) 596-615.
7. M.R. Garey, D.S. Johnson, Computers and intractability: a Guide to the Theory of NP-completeness, Freeman, New York, 1979.
8. F.K. Hwang, D.S. Richards, Winter, The Steiner tree problem, Annals of Discrete Mathematics 53 (1992).
9. E. Ihler, Bounds on the quality of approximate solutions to the group Steiner problem, in: Proc. 17th Graph-Theoretic Concepts in Computer Science, Springer Lecture Notes in Computer Science, vol. 484, 1991, pp. 109-118.
10. E. Ihler, Zur Übertragbarkcit von Approximationsalgorithmen für Optimierungsprobleme, insbesondere für das Problem Class Tree, Ph.D. thesis, Institut für Informatik, Universität Freiburg. Deutschland, 1993.
11. E. Ihler, The rectilinear class Steiner tree problem for intervals on two parallel lines, Mathematical Programming, Ser. B, 63(3) (1994) 281-296.
12. R.M. Karp, Reducibility among combinatorial problems. in: Complexity of Computer Computations. 1972, New York, pp. 85-103.
13. L. Kou, G. Markowsky, L. Berman, A fast algorithm for Steiner trees, Acta Inform. 15 (1981) 141-145.
14. C. Lund, M. Yannakakis, On the hardness of approximating minimization problems, in: Proc. 25th Annual ACM Symp. on Theory of Computing. 1993, pp. 14-23.
15. N. Maculan, The Steiner problem in graphs, Ann. Discrete Math. 31 (1987) 185-212.
16. K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs, Inform. Process. Lett. 27 (1988) 125-128.
17. K. Mehlhorn, S. Näher, LEDA, a Library of Efficient Data types and Algorithms, Techn. Bericht Nr. A 04/89. Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, 1989.
18. C.H, Papadimitriou, M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991) 425-140.
19. R.C. Prim, Shortest connection networks and some generalizations, Bell Syst. Tech. J. 36 (1957) 1389-1401.
20. G. Reich, Zur Komplexität von Graphen-und geometrischen Problemen bei farbigen Knoten und Punkten: Effiziente Algorithmen und Heuristiken, Ph.D. thesis, Institut für Informatik, Universität Freiburg, Deutschland, 1992.
21. S. Schiller, Yet another floorplanner, Diplomarbeit, Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe (1989).
22. H. Takahashi, Matsuyama, A. An approximate solution for the Steiner problem in graphs, Math. Japonica 24 (1980) 573-577.
23. J. van Leeuwen, Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity, Elsevier, Amsterdam, 1990.