The fractional prize-collecting steiner tree problem on trees

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

Volumn 2832, Issue , 2003, Pages 691-702

  Klau, Gunnar W ^a   Ljubić, Ivana ^a   Mutzel, Petra ^a   Pferschy, Ulrich ^b   Weiskircher, René ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF GRAZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; NEWTON-RAPHSON METHOD;

BINARY SEARCH; EDGE COSTS; ENERGY SUPPLY MANAGEMENT; FIXED COST; PRIZE COLLECTING STEINER TREE PROBLEM; RUNNING TIME; S-METHOD; SUB TREES;

TREES (MATHEMATICS);

EID: 0142183756     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_62     Document Type: Article

References (15)

1. D. Bienstock, M. X. Goemans, D. Simchi-Levi, and D. Williamson. A note on the prize collecting traveling salesman problem. Mathematical Programming, 59:413-420, 1993.
2. J. D. Boissonnat and M. Yvinec. Algorithmic Geometry. Cambridge University Press, 1998.
3. W. Dinkelbach. On nonlinear fractional programming. Management Science, 13:492-498, 1967.
4. G. W. Duin and A. Volgenant. Some generalizations of the Steiner problem in graphs. Networks, 17(2):353-364, 1987.
5. J. Feigenbaum, C. H. Papadimitriou, and S. Shenker. Sharing the cost of multicast transmissions. Journal of Computer and System Sciences, 63(1):21-41, 2001.
6. M. Fischetti. Facets of two Steiner arborescence polyhedra. Mathematical Programming, 51:401-419, 1991.
7. M. X. Goemans. The Steiner tree polytope and related polyhedra. Mathematical Programming, 63:157-182, 1994.
8. M. X. Goemans and D. P. Williamson. The primal-dual method for approximation algorithms and its application to network design problems. In D. S. Hochbaum, editor, Approximation algorithms for NP-hard problems, pages 144-191. P. W. S. Publishing Co., 1996.
9. S. Hert, L. Kettner, T. Polzin, and G. Schäfer. Explab. http://explab.sourceforge.net, 2002.
10. G. Klau, I. Ljubić, P. Mutzel, U. Pferschy, and R. Weiskircher. The fractional prize-collecting Steiner tree problem on trees. Technical Report TR-186-1-03-01, Institute of Computer Graphics and Algorithms, Vienna University of Technology, 2003.
11. N. Megiddo. Combinatorial optimization with rational objective functions. Mathematics of Operations Research, 4(4):414-424, 1979.
12. T. Radzik. Newton's method for fractional combinatorial optimization. In Proceedings of 33rd Annual Symposium on Foundations of Computer Science, pages 659-669, 1992.
13. T. Radzik. Fractional combinatorial optimization. In D. Z. Du and P. Pardalos, editors, Handbook of Combinatorial Optimization, pages 429-478. Kluwer, 1998.
14. A. Segev. The node-weighted Steiner tree problem. Networks, 17:1-17, 1987.
15. L. A. Wolsey. Integer Programming. John Wiley, New York, 1998.