Matching based augmentations for approximating connectivity problems

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

Volumn 3887 LNCS, Issue , 2006, Pages 13-24

  Ravi, R ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUY-AT-BULK TYPE NETWORK DESIGN PROBLEMS; LOGARITHMIC PERFORMANCE RATIO; NETWORK DESIGN PROBLEMS; SPANNING TREE PROBLEM;

APPROXIMATION THEORY; FUNCTIONS; GRAPHIC METHODS; PROBLEM SOLVING;

VIRTUAL REALITY;

EID: 33745604915     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11682462_4     Document Type: Conference Paper

References (14)

1. C. Chekuri, S. Khanna, and S, Naor. A deterministic algorithm for the COST-DISTANCE problem. Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 232-233, 2001.
2. N. Christofides. Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388, Graduate School of Industrial Administration, CMU, 1976.
3. A.M. Frieze, G. Galbiati, and F. Maffioli. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12 (1982) 23-39.
4. M. Fürer and B. Raghavachari. An NC approximation algorithm for the minimum-degree spanning tree problem. Proceedings of the 28th Annual Allerton Conference on Communication, Control and Computing 274-281, 1990.
5. A. Goel and D. Estrin. Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk. Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003.
6. D. Hochbaum, editor. Approximation algorithms for NP-hard problems. P.W.S, 1997.
7. Philip N. Klein and R. Ravi. A nearly best-possible approximation algorithm for node-weighted Steiner trees. J. Algorithms, 19(1):104-115, 1995.
8. An early version appeared in the Proceedings of the Annual MPS conference on Integer Programming and Combinatorial Optimization, 1992.
9. M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt. Bicriteria network design problems. J. of Algorithms, 28, 142171, 1998.
10. A. Meyerson, K. Munagala, and S. Plotkin, Cost-Distance: Two Metric Network Design. Proceedings of the 41st Annual IEEE Symposium on the Foundations of Computer Science, 2000.
11. Many birds with one stone: Multi-objective approximation algorithms. R. Ravl, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt III. Proceedings of the ACM Symposium on the Theory of Computing, 438-447, 1993.
12. R. Ravi. Rapid Rumor Ramification: Approximating the minimum broadcast time. Proceedings of the 35th Annual IEEE Symposium on the Foundations of Computer Science, 202-213, 1994.
13. Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, H. B. Hunt III. Algorithmic 31(1), 58-78, 2001.
14. Vijay V. Vazirani. Approximation Algorithms. Springer-Verlag, Berlin, 2001.