209-226 Mixed covering of trees and the augmentation problem with odd diameter constraints

Algorithmica (New York)

Volumn 45, Issue 2, 2006, Pages 209-226

  Chepoi, Victor ^a   Estellon, Bertrand ^a   Nouioua, Karim ^a   Vaxès, Yann ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Approximation algorithms; Augmentation problem; Diameter; Dynamical programming; Partial covering

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; AUGMENTATION PROBLEM; DIAMETER; PARTIAL COVERING;

TREES (MATHEMATICS);

EID: 33646523604     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-005-1183-9     Document Type: Article

References (16)

1. N. Alon, A. Gyárfás, M. Ruszinkó. Decreasing the diameter of bounded degree graphs. J. Graph Theory, 35(2000), 161-172.
2. A. Brandstädt, V.B. Le, J.P. Spinrad, Graph Classes, SLAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, PA, 1999.
3. V. Chepoi, Y. Vaxès, Augmenting trees to meet biconnectivity and diameter constraints, Algorithmica, 33 (2002), 243-262.
4. F.R.K. Chung, Diameters of graphs: old problems and new results, Congr.Numer., 60 (1987), 295-317.
5. F.R.K. Chung, M.R. Garey, Diameter bounds for altered graphs, J. Graph Theory, 8 (1984), 511-534.
6. Y. Dodis, S. Khanna, Designing networks with bounded pairwise distance, Proc. Annual ACM Symposium on the Theory of Computing, 1999, pp. 750-759.
7. P. Erdós, A. Gyárfás, M. Ruszinkó, How to decrease the diameter of triangle-free graphs, Combinatorica, 18 (1998), 493-501.
8. K.P. Eswaran, R.E. Tarjan, Augmentation problems, SIAM J. Comput., 5 (1976), 653-665.
9. R. Gandhi, S. Khuller, A. Srinivasan, Approximation algorithms for partial covering problems, J. Algorithms, 53 (2004), 54-84.
10. T. Ibaraki, N. Katoh, Resource Allocation Problems. Algorithmic Approaches, MIT Press, Cambridge, MA, 1988.
11. T. Ishii, S. Yamamoto, H. Nagamochi, Augmenting forests to meet odd diameter requirements, Proc. International Symposium on Algorithms and Computation (ISAAC '03), Lecture Notes in Computer Science, vol. 2906, Springer-Verlag, Berlin. 2003, pp. 434-443.
12. M. Kearns, The Computational Complexity of Machine Learning, MIT Press, Cambridge, MA, 1990.
13. Ch.-L. Li, S.Th. McCormick, D. Simchi-Levi, On the minimum-cardinality- bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems, Oper. Res. Lett., 11 (1992), 303-308.
14. N. Megiddo, E. Zemel, S.L. Hakimi, The maximum coverage location problem, SIAM J. Algebraic Discrete Methods, 4 (1983), 253-261.
15. A.A. Schoone, H.L. Bodlaender, J. van Leeuwen, Diameter increase caused by edge deletion, J. Graph Theory, 11 (1987), 409-427.
16. V.V. Vazirani, Approximation Algorithms, Springer-Verlag, Berlin, 2001.