The Steiner tree problem on graphs: Inapproximability results

Theoretical Computer Science

Volumn 406, Issue 3, 2008, Pages 207-214

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

^a UNIVERSITY OF SUSSEX   (United Kingdom)

^b Faculty of Natural Sciences   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; NUCLEAR PROPULSION;

INAPPROXIMABILITY; MINIMUM WEIGHT; NP-HARD; STEINER TREE PROBLEM; SUB TREES; WEIGHTED GRAPHS;

TREES (MATHEMATICS);

EID: 52149091914     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.06.046     Document Type: Article

References (17)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification an hardness of approximation problems, in: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992, pp. 14-23
2. Bassalygo L.A. Asymptotically optimal switching circuits. Problems in Information Transmission 17 (1981) 206-211
3. Bern M., and Plassmann P. The Steiner problem with edge lengths 1 and 2. Information Processing Letters 32 (1989) 171-176
4. Chlebík M., and Chlebíková J. Approximation hardness for small occurrence instances of NP-hard problems. Proceedings of the 5th Conference on Algorithms and Complexity. CIAC. LNCS vol. 2653 (2003) 152-164 (also ECCC Report TR02-73, 2002)
5. Chung F.R.K. On concentrators, superconcentrators, generalizers, and nonblocking networks. The Bell System Technical Journal 58 (1978) 1765-1777
6. F.R.K. Chung, Spectral Graph Theory, in: CBMS Regional Conference Series in Mathematics, American Mathematical Society, ISSN 0160-7642, ISBN 0-8218-0315-8, 1997
7. Gabber O., and Galil Z. Explicit construction of linear-sized superconcentrators. Journal of Computer and System Sciences 22 (1981) 407-420
8. Håstad J. Some optimal inapproximability results. Journal of ACM 48 (2001) 798-859
9. Hougardy S., Gröpl C., Nierhoff T., and Prömel H.J. Approximation algorithms for the Steiner tree problem in graphs. In: Cheng X., and Du D.-Z. (Eds). Steiner Trees in Industry (2001), Kluwer Academic Publishers 235-279
10. Lubotzky A., Phillips P., and Sarnak P. Ramanujan graphs. Combinatorica 8 (1988) 261-277
11. Karp R.M. Reducibility among combinatorial problems. Complexity of Computer Computations. Proc. Sympos. IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, 1972 (1972), Plenum, New York 85-103
12. Margulis G.A. Explicit construction of concentrators. Problems of Information Transmission 9 (1973) 325-332
13. C.H. Papadimitriou, S. Vempala, On the approximability of the traveling salesman problem, in: Proceedings of the 32nd ACM Symposium on the Theory of Computing, Portland, 2000
14. G. Robins, A. Zelikovsky, Improved Steiner tree approximation in graphs, in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 770-779
15. Sarnak P. Some applications of modular forms. Cambridge Tracts in Mathematics vol. 99 (1990), Cambridge University Press, Cambridge
16. Thimm M. On the approximability of the steiner tree problem. Proceedings of the 26th International Symposium (MFCS 2001 Mariánske Lázne, Czech Republic, 27-31 August, 2001). LNCS vol. 2136 (2001), Springer 678-689
17. Thimm M. On the approximability of the steiner tree problem. Theoretical Computer Science 295 (2003) 387-402 (journal version)