New geometry-inspired relaxations and algorithms for the metric steiner tree problem

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

Volumn 5035 LNCS, Issue , 2008, Pages 344-358

  Chakrabarty, Deeparnab ^a   Devanur, Nikhil R ^b   Vazirani, Vijay V ^a  

^a Georgia Institute of Technology   (United States)

^b TOYOTA TECHNOLOGICAL INSTITUTE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; DUAL SOLUTIONS; HEIDELBERG (CO); INTEGRALITY GAPS; INTERNATIONAL CONFERENCES; OF GRAPHS; OPEN PROBLEMS; PRIMAL-DUAL; SPRINGER (CO); STEINER TREE PROBLEM (STP); STRONGLY POLYNOMIAL ALGORITHM;

AEROSPACE APPLICATIONS; ALGORITHMS; APPROXIMATION ALGORITHMS; ARCHITECTURAL DESIGN; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; EVOLUTIONARY ALGORITHMS; GALLIUM ALLOYS; GEOMETRY; GRAPH THEORY; LINEAR PROGRAMMING; MATHEMATICAL PROGRAMMING; NONLINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SCHEDULING ALGORITHMS; TREES (MATHEMATICS);

INTEGER PROGRAMMING;

EID: 45749083426     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68891-4_24     Document Type: Conference Paper

References (19)

1. Agarwal, A., Charikar, M.: On the advantage of network coding for improving network throughput. In: Proceedings of the IEEE Information Theory Workshop (2004)
2. Bern, M., Plassman, P.: The Steiner problem with edge lengths 1 and 2. Inform. Process. Lett. 32, 171-176 (1989)
3. Chlebik, M., Chlebikova, J.: Approximation hardness of the steiner tree problem on graphs. In: Proceedings of Scandinavian Workshop on Algorithm Theory (2002)
4. Chakrabarty, D., Devanur, N.R., Vazirani, V.V.: New geometry-inspired relaxations and algorithms for the Metric Steiner Tree Problem (2007), http://www.cc.gatech.edu/∼deepc
5. Calinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. In: STOC (1998)
6. Chopra, S., Rao, M.R.: The Steiner tree problem I: Formulations, compositions and extension of facets. Math. Programming 64, 209-229 (1994)
7. Chopra, S., Rao, M.R.: The Steiner tree problem II: Properties and classes of facets. Math. Programming 64, 231-246 (1994)
8. Courant, R., Robbins, H., Stewart, I.: What Is Mathematics?: An Elementary Approach to Ideas and Methods. Oxford Papebacks (1996)
9. Edmonds, J.: Optimum branchings. Journal of Research of the National Bureau of Standards. Section B 71, 233-240 (1967)
10. Goemans, M., Myung, Y.: A catalog of Steiner tree formulations. NETWORKS 23, 19-23 (1993)
11. Goemans, M.: Personal communication (1996)
12. Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Annals of Discrete Mathematics, vol. 53. North-Holland, Amsterdam, Netherlands (1992)
13. Ivanov, A.O., Tuzhilin, A.A.: The Steiner problem and its generalizations. CRC Press, BocaRaton, Ann Arbor, London, Tokyo (1994)
14. Jain, K., Vazirani, V.V.: Equitable cost allocations via primal-dual-type algorithms. In: Proceedings of 33rd ACM Symposium on Theory of Computing (2002)
15. Konemann, J., Pritchard, D., Tan, K.: A partition based relaxation for Steiner trees (manuscript)
16. Rizzi, R.: On Rajagopalan and Vazirani's 3/2-approximation bound for the iterated 1-Steiner heuristic. Information Processing Letters 86, 335-338 (2003)
17. Rajagopalan, S., Vazirani, V.: On the bidirected cut relaxation for the metric Steiner tree problem. In: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms (1999)
18. Robins, G., Zelikovsky, A.: Tighter bounds for graph Steiner tree approximation. SIAM Journal of Discrete Mathematics 19, 122-134 (2005)
19. Wong, R.T.: A dual ascent approach for Steiner trees on a directed graph. Mathematical Programming 28, 271-287 (1984)