An improved LP-based approximation for steiner tree

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 583-592

  Byrka, Jaroslaw ^a   Grandoni, Fabrizio ^b   Rothvoß, Thomas ^a   Sanità, Laura ^a  

^a EPFL   (Switzerland)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

approximation algorithms; linear programming relaxations; network design; randomized algorithms

Indexed keywords

APPROXIMATION FACTOR; APPROXIMATION RATIOS; FRACTIONAL SOLUTIONS; INTEGRALITY GAPS; LINEAR PROGRAMMING RELAXATION; LP-RELAXATION; NETWORK DESIGN; NP-HARD PROBLEM; OPEN PROBLEMS; PROBABILITY PROPORTIONAL; RANDOMIZED ALGORITHMS; RANDOMIZED ROUNDING; SPANNING TREE; STEINER TREE PROBLEM; STEINER TREES; TERMINAL NODES; TREE SPANNING; WEIGHTED UNDIRECTED GRAPH;

COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; COSTS; LINEARIZATION; OPTIMIZATION; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS;

EID: 77954711587     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806769     Document Type: Conference Paper

References (44)

1. A. Agrawal, P. Klein, and R. Ravi. When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM Journal on Computing, 24(3): 440-456, 1995.
2. N. Alon and J. Spencer. The probabilistic method. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons Inc., Hoboken, NJ, third edition, 2008.
3. A. Archer, M. Bateni, M. Hajiaghayi, and H. Karloff. Improved approximation algorithms for prize-collecting Steiner tree and TSP. In FOCS, pages 427-436, 2009.
4. S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM, 45(5):753-782, 1998. (Pubitemid 128497506)
5. M. Bern and P. Plassmann. The Steiner problem with edge lengths 1 and 2. Information Processing Letters, 32(4):171-176, 1989.
6. A. Borchers and D. Du. The k-Steiner ratio in graphs. SIAM Journal on Computing, 26(3):857-869, 1997.
7. G. Borradaile, C. Kenyon-Mathieu, and P. Klein. A polynomial-time approximation scheme for Steiner tree in planar graphs. In SODA, pages 1285-1294, 2007.
8. D. Chakrabarty, N. R. Devanur, and V. V. Vazirani. New geometry-inspired relaxations and algorithms for the metric Steiner tree problem. In IPCO, pages 344-358, 2008.
9. M. Charikar and S. Guha. Improved combinatorial algorithms for facility location problems. SIAM Journal on Computing, 34:803-824, 2005. (Pubitemid 41246994)
10. M. Chlebík and J. Chlebíková. The Steiner tree problem on graphs: Inapproximability results. Theoretical Computer Science, 406(3):207-214, 2008.
11. S. E. Dreyfus and R. A. Wagner. The Steiner problem in graphs. Networks, 1:195-207, 1972.
12. J. Edmonds. Optimum branchings. J. Res. Nat. Bur. Standards, B71:233-240, 1967.
13. F. Eisenbrand and F. Grandoni. An improved approximation algorithm for virtual private network design. In SODA, pages 928-932, 2005.
14. F. Eisenbrand, F. Grandoni, G. Oriolo, and M. Skutella. New approaches for virtual private network designs. SIAM Journal on Computing 37(3): 706-721, 2007.
15. F. Eisenbrand, F. Grandoni, T. Rothvoß, and G. Schäfer. Approximating connected facility location problems via random facility sampling and core detouring. In SODA, pages 1174-1183, 2008.
16. F. Eisenbrand, F. Grandoni, T. Rothvoß, and G. Schäfer. Connected Facility Location via Random Sampling and Core Detouring. Journal of Computer and System Sciences. To appear.
17. A. Frank and É. Tardos. An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica, 7:49-65, 1987.
18. M. R. Garey and D. S. Johnson. The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics, 32:826-834, 1977.
19. M. R. Garey and D. S. Johnson. Computers and intractability. W. H. Freeman and Co., San Francisco, Calif., 1979. A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences.
20. E. N. Gilbert and H. O. Pollak. Steiner minimal trees. SIAM Journal on Applied Mathematics, 16(1):1-29, January 1968.
21. M. X. Goemans and Y. S. Myung. A catalog of Steiner tree formulations. Networks, 23:19-28, 1993.
22. M. X. Goemans and D.P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24:296-317, 1995.
23. F. Grandoni and G. F. Italiano. Improved approximation for single-sink buy-at-bulk. In ISAAC, pages 111-120, 2006.
24. M. Grötschel, L. Lovasz, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169-197, 1981.
25. A. Gupta, J. Kleinberg, A. Kumar, R. Rastogi, and B. Yener. Provisioning a virtual private network: a network design problem for multicommodity flow. In STOC, pages 389-398, 2001.
26. A. Gupta, A. Kumar, M. Pál, and T. Roughgarden. Approximation via cost sharing: simpler and better approximation algorithms for network design. Journal of the ACM, 54(3):11, 2007.
27. F.K. Hwang, D.S. Richards, and P. Winter. The Steiner tree problem. Monograph in Annals of Discrete Mathematics, 53. Elsevier, Amsterdam, 1992.
28. K. Jain. A factor 2 approximation algorithm for the generalized Steiner network problem. In FOCS, pages 448-457, 1998.
29. M. Karpinski and A. Zelikovsky. New approximation algorithms for the Steiner tree problems. Journal of Combinatorial Optimization, 1(1):47-65, 1997. (Pubitemid 127715942)
30. L. G. Khachiyan. A polynomial algorithm for linear programming. Soviet Math. Doklady, 20:191-194, 1979.
31. (Russian original in Doklady Akademiia Nauk SSSR, 244:1093-1096).
32. J. Könemann, D. Pritchard, and K. Tan. A partition-based relaxation for Steiner trees. CoRR, abs/0712.3568, 2007.
33. B. Korte and J. Vygen. Combinatorial Optimization - Theory and Algorithms. Springer-Verlag, Second Edition, 2002.
34. D. Mölle, S. Richter, and P. Rossmanith. A faster algorithm for the Steiner tree problem. In STACS 2006, pages 561-570, 2006.
35. T. Polzin and S. V. Daneshmand. On Steiner trees and minimum spanning trees in hypergraphs. Operations Research Letters, 31:12-20, 2003. (Pubitemid 35432900)
36. H. J. Prömel and A. Steger. A new approximation algorithm for the Steiner tree problem with performance ratio 5/3. Journal of Algorithms, 36:89-101, 2000.
37. S. Rajagopalan and V. V. Vazirani. On the bidirected cut relaxation for the metric Steiner tree problem. In SODA, pages 742-751, 1999.
38. R. Rizzi. On Rajagopalan and Vazirani's 3/2-approximation bound for the Iterated 1-Steiner heuristic. Information Processing Letters, 86(6):335-338, 2003.
39. G. Robins and A. Zelikovsky. Tighter bounds for graph Steiner tree approximation. SIAM Journal on Discrete Mathematics, 19(1):122-134, 2005.
40. A preliminary version appeared in SODA 2000.
41. C. Swamy and A. Kumar. Prima-dual algorithms for connected facility location problems. Algorithmica, 40(4):245-269, 2004. (Pubitemid 40871640)
42. K. Talwar. The single-sink buy-at-bulk LP has constant integrality gap. In IPCO, pages 475-486, 2002.
43. V. V. Vazirani. Approximation Algorithms. Springer-Verlag, 2001.
44. A. Z. Zelikovsky. An 11/6-approximation algorithm for the network Steiner problem. Algorithmica, 9:463-470, 1993.