Approximation hardness of the steiner tree problem on graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2368, Issue , 2002, Pages 170-179

  Chlebík, Miroslav ^a   Chlebíková, Janka ^b  

^a MAX PLANCK INSTITUTE FOR MATHEMATICS IN THE SCIENCES   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

APPROXIMATION HARDNESS; INAPPROXIMABILITY; MAXIMUM SATISFIABILITY; MINIMUM WEIGHT; MODULO 2; STEINER TREE PROBLEM; SUB TREES; WEIGHTED GRAPH;

TREES (MATHEMATICS);

EID: 84943263202     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45471-3_18     Document Type: Conference Paper

References (9)

1. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification an hardness of approximation problems. Proceedings of the 33rd Annual Symposium on Fundations of Computer Science, 1992, 14–23.
2. Bern, M., Plassmann, P.: The Steiner Problem with edge lengths 1 and 2. Information Processing Letters 32 (1989) 171–176
3. Chun, F. R. K.: Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, American Mathematical Society, 1997, ISSN 0160-7642, ISBN 0-8218-0315-8.
4. Håstad, J.: Some optimal inapproximability results. Proceedings of the 28rd Annual Symposium on Theory of Computing, ACM, 1997.
5. Hougardy, S., Gröpl, C., Nierhoff, T., Prömel, H. J.: Approximation algorithms for the Steiner tree problem in graphs. In Steiner Trees in Industry, (X. Cheng and D.-Z. Du, eds.), Kluwer Academic Publishers, 2001, 235–279.
6. Karp, R. M.: Reducibility among combinatorial problems, In Complexity of Computer Computations, (Proc. Sympos. IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), New York: Plenum 1972, 85–103.
7. Papadimitriou, C. H., Vempala, S.: On the Approximability of the Traveling Salesman Problem. Proceedings of the 32nd ACM Symposium on the theory of computing, Portland, 2000.
8. Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms 2000, 770–779.
9. Thimm, M.: On the Approximability of the Steiner Tree Problem. Proceedings of the 26th International Symposium, MFCS 2001 Mariánske Lázne, Czech Republic, August 27-31, 2001, Springer, Lecture Notes in Computer Science 2136 (2001) 678–689.