Augmenting forests to meet odd diameter requirements

Discrete Optimization

Volumn 3, Issue 2, 2006, Pages 154-164

  Ishii, Toshimasa ^a   Yamamoto, Shigeyuki ^b   Nagamochi, Hiroshi ^c  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

^b I FOR COM CoLtd   (Japan)

^c KYOTO UNIVERSITY   (Japan)

Author keywords

Approximation algorithm; Diameter; Forest; Graph augmentation problem; Undirected graph

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; DIAMETER; GRAPH AUGMENTATION PROBLEMS; UNDIRECTED GRAPHS;

GRAPH THEORY;

EID: 33748704465     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2005.10.006     Document Type: Article

References (17)

1. Alon N., Gyárfás A., and Ruszinkó M. Decreasing the diameter of bounded degree graphs. J. Graph Theory 35 (2000) 161-172
2. Berge C. Hypergraphs (1989), Elsevier, North-Holland, Amsterdam
3. Brandstädt A., Dragan F., Chepoi V., and Voloshin V. Dually chordal graphs. SIAM J. Discrete Math. 11 3 (1998) 437-455
4. Chandrasekaran R., and Daughety A. Location on tree networks: p-center and n-dispersion problems. Math. Oper. Res. 6 1 (1981) 50-57
5. V. Chepoi, personal communication, 2003
6. Chepoi V., and Vaxes Y. Augmenting trees to meet biconnectivity and diameter constraints. Algorithmica 33 (2002) 243-262
7. Chung F.R.K. Diameter of graphs: old problems and new results. Congr. Numer. 60 (1987) 295-317
8. Y. Dodis, S. Khanna, Designing networks with bounded pairwise distance, in: Proc. 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 750-759
9. Erdo{combining double acute accent}s P., Gyárfás A., and Ruszinkó M. How to decrease the diameter of triangle-free graphs. Combinatorica 18 4 (1998) 493-501
10. Eswaran K.P., and Tarjan R.E. Augmentation problems. SIAM J. Comput. 5 (1976) 653-665
11. Frank A. Connectivity augmentation problems in network design. In: Birge J.R., and Murty K.G. (Eds). Mathematical Programming: State of the Art 1994 (1994), The University of Michigan, Ann Arbor, MI 34-63
12. Jackson B., and Jordán T. A near optimal algorithm for vertex connectivity augmentation. Algorithms and Computation (Proc. ISAAC '00). Lecture Notes in Computer Science vol. 1969 (2000) 312-325
13. Li C., McCormick S., and Simchi-Levi D. On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems. Oper. Res. Lett. 11 (1992) 303-308
14. Nagamochi H., and Ibaraki T. Graph connectivity and its augmentation: applications of MA orderings. Discrete Appl. Math. 123 1 (2002) 447-472
15. Schoone A.A., Bodlaendar H.L., and van Leeuwen J. Diameter increase caused by edge deletion. J. Graph Theory 11 3 (1987) 409-427
16. Tarjan R.E. Depth-first search and linear graph algorithms. SIAM J. Comput. 1 (1972) 146-160
17. Watanabe T., and Nakamura A. Edge-connectivity augmentation problems. J. Comput. System Sci. 35 (1987) 96-144