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

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

Volumn 6281 LNCS, Issue , 2010, Pages 150-161

  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

[No Author keywords available]

Indexed keywords

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

COMPUTER SCIENCE;

ASYMPTOTIC ANALYSIS;

EID: 78349232751     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15155-2_15     Document Type: Conference Paper

References (20)

1. Alon, N., Gyárfás, A., Ruszinkó, M.: Decreasing the diameter of bounded degree graphs. Journal of Graph Theory 35(3), 161-172 (2000)
2. Brandstädt, A., Le, V.B., Spinrad, J.: Graph classes: a survey. SIAM Monographs on Discrete Mathematics and Applications (1999)
3. Chandrasekaran, R., Daughety, A.: Location on tree networks: p-centre and n-dispersion problems. Mathematics of Operations Research 6(1), 50-57 (1981)
4. Chepoi, V., Estellon, B., Nouioua, K., Vaxès, Y.: Mixed covering of trees and the augmentation problem with odd diameter constraints. Algorithmica 45(2), 209-226 (2006)
5. Chepoi, V., Vaxès, Y.: Augmenting trees to meet biconnectivity and diameter constraints. Algorithmica 33(2), 243-262 (2002)
6. Chung, F.: Diameters of graph: old problems and new results. Congr. Numer. 60, 295-317 (1987)
7. Chung, F., Garey, M.: Diameter bounds for altered graphs. Journal of Graph Theory 8(4), 511-534 (1984)
8. Dodis, Y., Khanna, S.: Designing networks with bounded pairwise distance. In: STOC, pp. 750-759 (1999)
9. Erdös, P., Gyárfás, A., Ruszinkó, M.: How to decrease the diameter of triangle-free graphs. Combinatorica 18(4), 493-501 (1998)
10. Erdös, P., Rényi, A.: On a problem in the theory of graphs. Publ. Math. Inst. Hung. Acad. Sci. B(7), 623-639 (1963)
11. Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293-306 (1985)
12. Grigorescu, E.: Decreasing the diameter of cycles. J. Graph Theory 43(4), 299-303 (2003)
13. Ishii, T., Yamamoto, S., Nagamochi, H.: Augmenting forests to meet odd diameter requirements. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 434-443. Springer, Heidelberg (2003)
14. Kapoor, S., Sarwat, M.: Bounded-diameter minimum-cost graph problems. Theory Comput. Syst. 41(4), 779-794 (2007)
15. Kariv, O., Hakimi, S.: An algorithmic approach to network location problems. SIAM Journal on Applied Mathematics 37(3), 513-538 (1979)
16. Li, C.-L., McCormick, S.T., Simchi-Levi, D.: On the minimum-cardinality- bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problem. Operations Research Letters 11, 303-308 (1992)
17. Plesník, J.: On the computational complexity of centers locating in a graph. Aplikace Mat. 25
18. Plesník, J.: The complexity of designing a network with minimum diameter. Networks 11(1), 77-85 (1981)
19. Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a subconstant error-probability pcp characterization of np. In: STOC, pp. 475-484 (1997)
20. Schoone, A.A., Bodlaender, H.L., van Leeuwen, J.: Diameter increase caused by edge deletion. Journal of Graph Theory 11(3), 409-427 (1987)