Improved approximability and non-approximability results for graph diameter decreasing problems

Theoretical Computer Science

Volumn 417, Issue , 2012, Pages 12-22

  Bilò, Davide ^a   Gualà, Luciano ^b   Proietti, Guido ^a,c  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

^c CNR   (Italy)

Author keywords

Approximation algorithms; Diameter; Edge addition; Graphs

Indexed keywords

APPROXIMABILITY; APPROXIMATION RATIOS; DIAMETER; EDGE ADDITION; GRAPH DIAMETER; GRAPH G; GRAPHS; MULTIPLICATIVE FACTORS; NON-APPROXIMABILITY; NP-HARD; POSITIVE INTEGERS;

APPROXIMATION ALGORITHMS;

GRAPH THEORY;

EID: 84855942465     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.05.014     Document Type: Conference Paper

References (25)

1. Noga Alon, Andrs Gyrfs, and Mikls Ruszink Decreasing the diameter of bounded degree graphs Journal of Graph Theory 35 3 2000 161 172
2. R. Balakrishnan, and K. Ranganathan A Textbook of Graph Theory 2000 Springer
3. Andreas Brandstdt, Van Bang Le, and Jeremy Spinrad Graph classes: a survey SIAM Monographs on Discrete Mathematics and Applications 1999
4. R. Chandrasekaran, and Andrew F. Daughety Location on tree networks: p-centre and n-dispersion problems Mathematics of Operations Research 6 1 1981 50 57
5. Victor Chepoi, Bertrand Estellon, Karim Nouioua, and Yann Vaxs Mixed covering of trees and the augmentation problem with odd diameter constraints Algorithmica 45 2 2006 209 226
6. Victor Chepoi, and Yann Vaxs Augmenting trees to meet biconnectivity and diameter constraints Algorithmica 33 2 2002 243 262
7. F.R.K. Chung Diameters of graph: old problems and new results Congressus Numerantium 60 1987 295 317
8. F.R.K. Chung, and M.R. Garey Diameter bounds for altered graphs Journal of Graph Theory 8 4 1984 511 534
9. Erik D. Demaine, and Morteza Zadimoghaddam Minimizing the diameter of a network using shortcut edges Haim Kaplan, Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory SWAT Lecture Notes in Computer Science vol. 6139 2010 Springer 420 431
10. Yevgeniy Dodis, Sanjeev Khanna, Designing networks with bounded pairwise distance, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC, 1999, pp. 750759.
11. Paul Erds, Andrs Gyrfs, and Mikls Ruszink How to decrease the diameter of triangle-free graphs Combinatorica 18 4 1998 493 501
12. Paul Erds, and Alfrd Rnyi On a problem in the theory of graphs Publications of the Mathematical Institute of the Hungarian Academy of Sciences (series B) 7 1963 623 639
13. Teofilo F. Gonzalez Clustering to minimize the maximum intercluster distance Theoretical Computer Science 38 1985 293 306
14. Elena Grigorescu Decreasing the diameter of cycles Journal of Graph Theory 43 4 2003 299 303
15. Dorit S. Hochbaum, and David B. Shmoys A unified approach to approximation algorithms for bottleneck problems Journal of the ACM 33 3 1986 533 550
16. Toshimasa Ishii, Shigeyuki Yamamoto, and Hiroshi Nagamochi Augmenting forests to meet odd diameter requirements Discrete Optimization 3 2 2006 154 164 (Pubitemid 44389540)
17. David S. Johnson Approximation algorithms for combinatorial problems Journal of Computer and System Science 9 3 1974 256 278
18. Sanjiv Kapoor, and Mohammad Sarwat Bounded-diameter minimum-cost graph problems Theory of Computing Systems 41 4 2007 779 794
19. O. Kariv, and S.L. Hakimi An algorithmic approach to network location problems SIAM Journal on Applied Mathematics 37 3 1979 513 538 (Pubitemid 10432631)
20. Chung-Lun Li, S. Thomas McCormick, and David Simchi-Levi On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum- diameter edge addition problem Operations Research Letters 11 1992 303 308
21. Adam Meyerson, and Brian Tagiku Minimizing average shortest path distances via shortcut edge addition Irit Dinur, Klaus Jansen, Joseph Naor, Jos D.P. Rolim, Proceedings of the 12th International Workshop on Approximation, Randomization, and Combinatorial Optimization (APPROX-RANDOM) Lecture Notes in Computer Science vol. 5687 2009 Springer 272 285
22. Jan Plesnk, On the computational complexity of centers locating in a graph. Aplikace Mat., 25.
23. Jan Plesnk The complexity of designing a network with minimum diameter Networks 11 1 1981 77 85
24. Ran Raz, Shmuel Safra, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, STOC, 1997, pp. 475484.
25. Anneke A. Schoone, Hans L. Bodlaender, and Jan van Leeuwen Diameter increase caused by edge deletion Journal of Graph Theory 11 3 1987 409 427