Improved approximations for tour and tree covers

Algorithmica (New York)

Volumn 38, Issue 3, 2003, Pages 441-449

  Könemann, Jochen ^a   Konjevod, Goran ^b   Parekh, Ojas ^b   Sinha, Amitabh ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Graph algorithms; Network design

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; FUNCTION EVALUATION; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS); VECTORS;

APPROXIMATION ALGORITHMS; GRAPH ALGORITHMS; NETWORK DESIGN;

APPROXIMATION THEORY;

EID: 21044457828     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1071-0     Document Type: Article

References (12)

1. E. M. Arkin, M. M. Halldórsson, and R. Hassin. Approximating the tree and tour covers of a graph. Information Processing Letters, 47:275-282, 1993.
2. 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.
3. R. D. Carr, T. Fujito, G. Konjevod, and O. Parekh. A 21/10-approximation algorithm for a generalization of the weighted edge-dominating set problem. In Proceedings of ESA '00, pages 132-142, 2000.
4. L. Fleischer. Approximating fractional multicommodity flow independent of the number of commodities. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 24-31, 1999.
5. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 300-309, 1998.
6. M. X. Goemans and D. J. Bertsimas. Survivable networks, linear programming relaxations and the parsimonious property. Mathematical Programming, 60:145-166, 1993.
7. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin 1988.
8. R. Rizzi, On the Steiner tree 3/2-approximation for quasi-bipartite graphs. Technical Report No. RS-99-39, BRICS Report Series, Aarhus University, Denmark.
9. G. Robins and A. Zelikovsky, Improved Steiner tree approximation in graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 770-779, 2000.
10. D. B. Shmoys and D. P. Williamson. Analyzing the Held-Karp TSP bound: a monotonicity property with application. Information Processing Letters, 35:281-285, 1990.
11. V. V. Vazirani and S. Rajagopalan, On the bidirected cut relaxation for the metric Steiner tree problem. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 742-751, 1999.
12. L. A. Wolsey, Heuristic analysis, linear programming and branch and bound. Mathematical Programming Study, 13:121-134, 1980.