Approximate k-Steiner forests via the Lagrangian relaxation technique with internal preprocessing

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

Volumn 4168 LNCS, Issue , 2006, Pages 600-611

  Segev, Danny ^a   Segev, Gil ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STRUCTURES; LAGRANGE MULTIPLIERS; PROBLEM SOLVING;

APPROXIMATION ALGORITHM; INTERNAL PREPROCESSING; K-STEINER FORESTS; LAGRANGIAN RELAXATION TECHNIQUE;

GRAPH THEORY;

EID: 33750723122     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_54     Document Type: Conference Paper

References (16)

1. A. Agrawal, P. N. 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. S. Arora and G. Karakostas. A 2 + ε approximation algorithm for the k-MST problem. In 11th SODA, pages 754-759, 2000.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998.
4. Y. Asahiro, K. Iwama, H. Tamaki, and T. Tokuyama. Greedily finding a dense subgraph. Journal of Algorithms, 34(2):203-221, 2000.
5. D. Bienstock, M. X. Goemans, D. Simchi-Levi, and D. P. Williamson. A note on the prize collecting traveling salesman problem. Mathematical Programming, 59:413-420, 1993.
6. A. Blum, R. Ravi, and S. Vempala. A constant-factor approximation algorithm for the k-MST problem. Journal of Computer and System Sciences, 58(1):101.-108, 1999.
7. U. Feige, G. Kortsarz, and D. Peleg. The dense k-subgraph problem. Algorithmica, 29(3):410-421, 2001.
8. U. Feige and M. Langberg. Approximation algorithms for maximization problems arising in graph partitioning. Journal of Algorithms, 41(2): 174-211, 2001.
9. N. Garg. A 3-approximation for the minimum tree spanning k vertices. In 37th FOCS, pages 302-309, 1996.
10. N. Garg. Saving an epsilon: A 2-approximation for the k-MST problem in graphs. In 37th STOC, pages 396-402, 2005.
11. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24(2):296-317, 1995.
12. M. Hajiaghayi and K. Jain. The prize-collecting generalized Steiner tree problem via a new approach of primal-dual schema. In 17th SODA, pages 631-640, 2006.
13. Q. Han, Y. Ye, and J. Zhang. An improved rounding method and semidefinite programming relaxation for graph partition. Mathematical Programming, 92(3):509-535, 2002.
14. A. Levin and D. Segev. Partial multicuts in trees. In 3rd WAOA, pages 320-333, 2005.
15. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43(3):425-440, 1991.
16. R. Ravi and M. X. Goemans. The constrained minimum spanning tree problem (extended abstract). In 5th SWAT, pages 66-75, 1996.