Approximation algorithms for prize collecting forest problems with submodular penalty functions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 1275-1284

  Sharma, Yogeshwer ^a   Swamy, Chaitanya ^b   Williamson, David P ^c  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORESTRY;

CONSTRAINED FOREST PROBLEM; LP-ROUNDING; PENALTY FUNCTION; PERFORMANCE GUARANTEES; PRIMAL DUAL ALGORITHMS; PRIZE-COLLECTING; STEINER TREES; SUBMODULAR FUNCTION MINIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 77952372737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. [Bal89] Egon Balas. The prize collecting traveling salesman problem. Networks, 19:621-636, 1989.
2. [BGSLW93] Daniel Bienstock, Michel X. Goemans, David Simchi-Levi, and David P. Williamson. A note on the prize collecting traveling salesman problem. Math. Programming, 59:413-420, 1993.
3. [Edm70] Jack Edmonds. Submodular functions, matroids, and certain polyhedra. In R. Guy, H. Hanani, N. Sauer, and J. Schönheim, editors, Combinatorial Structures and Their Applications, pages 68-87, 1970.
4. [GLS88] M. Grötschel, L. Lovász, and A. Schrijver. Geometric algorithms and combinatorial optimization. Springer Verlag, 1988.
5. [Goe98] Michel Goemans, 1998. Personal communication.
6. [GW95] Michel X. Goemans and David P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24(2):296-317, 1995.
7. [HJ06] M.T. Hajiaghayi and K. Jain. The prize-collecting generalized Steiner tree problem via a new approach of primal-dual schema. In SODA, pages 631-640, 2006.
8. [HST05] Ara Hayrapetyan, Chaitanya Swamy, and Éva Tardos. Network design for information networks. In SODA, pages 933-942, 2005.
9. [IFF01] S. Iwata, L. Fleischer, and S. Fujishige. A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM, 48(4):761-777, 2001.
10. [Jai01] Kamal Jain. A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica, 21(1):39-60, 2001.
11. [JMP00] David S. Johnson, Maria Minkoff, and Steven Phillips. The prize collecting Steiner tree problem: theory and practice. In SODA, pages 760-769, 2000.
12. [KN06] G. Kortsarz and Z. Nutov. Approximating minimum cost connectivity problems. In T. Gonzales, editor, Handbook of Approximation Algorithms and Metaheuristics. CRC Press, 2006.
13. [Sch00] A. Schrijver. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theory, Ser. B, 80(2):346-355, 2000.