Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem

Information Processing Letters

Volumn 103, Issue 5, 2007, Pages 195-202

  Feofiloff, Paulo ^a   Fernandes, Cristina G ^a   Ferreira, Carlos E ^a   de Pina, José Coelho ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Approximation algorithms; Primal dual method; Prize collecting Steiner tree

Indexed keywords

GRAPH THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

PRIMAL-DUAL METHOD; PRIZE-COLLECTING STEINER TREE;

APPROXIMATION ALGORITHMS;

EID: 34250185392     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.03.012     Document Type: Article

References (11)

1. Chudak F., Roughgarden T., and Williamson D.P. Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. Mathematical Programming A 100 2 (2004) 411-421
2. R. Cole, R. Hariharan, M. Lewenstein, E. Porat, A faster implementation of the Goemans-Williamson clustering algorithm, in: Symposium on Discrete Algorithms, 2001, pp. 17-25
3. 2 log n) implementation of an approximation for the prize-collecting Steiner tree problem. Manuscript available at (2002). http://www.ime.usp.br/~cris/publ/implpcst.ps.gz
4. Feofiloff P., Fernandes C.G., Ferreira C.E., and de Pina J. A note on Johnson, Minkoff and Phillips' algorithm for the prize-collecting Steiner tree problem. Manuscript available at (2006). http://www.ime.usp.br/~cris/publ/jmp-analysis.ps.gz
5. Gabow H.N., Goemans M.X., and Williamson D.P. An efficient approximation algorithm for the survivable network design problem. Mathematical Programming Ser. B 82 1-2 (1998) 13-40
6. N. Garg, A 3-approximation for the minimum tree spanning k vertices, in: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS), 1996, pp. 320-309
7. Goemans M.X., and Williamson D.P. A general approximation technique for constrained forest problems. SIAM Journal on Computing 24 2 (1995) 296-317
8. In: Hochbaum D.S. (Ed). Approximation Algorithms for NP-Hard Problems (1997), PWS Publishing
9. D.S. Johnson, M. Minkoff, S. Phillips, The prize collecting Steiner tree problem: theory and practice, in: Symposium on Discrete Algorithms, 2000, pp. 760-769
10. Klein P. A data structure for bicategories, with application to speeding up an approximation algorithm. Information Processing Letters 52 6 (1994) 303-307
11. M. Minkoff, The prize-collecting Steiner tree problem, Master's thesis, MIT, 2000