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

In this paper, we study two variants of the problem of adding edges to a graph so as to reduce the resulting diameter. More precisely, given a graph G=(V,E), and two positive integers D and B, the Minimum-Cardinality Bounded-Diameter Edge Addition (MCBD) problem is to find a minimum-cardinality set F of edges to be added to G in such a way that the diameter of G+F is less than or equal to D, while the Bounded-Cardinality Minimum-Diameter Edge Addition (BCMD) problem is to find a set F of B edges to be added to G in such a way that the diameter of G+F is minimized. Both problems are well known to be NP-hard, as well as approximable within O(lognlogD) and 4 (up to an additive term of 2), respectively. In this paper, we improve these long-standing approximation ratios to O(logn) and to 2 (up to an additive term of 2), respectively. As a consequence, we close, in an asymptotic sense, the gap on the approximability of MCBD, which was known to be not approximable within clogn, for some constant c>0, unless P=NP. Remarkably, as we further show in the paper, our approximation ratio remains asymptotically tight even if we allow for a solution whose diameter is optimal up to a multiplicative factor approaching 53. On the other hand, on the positive side, we show that at most twice of the minimal number of additional edges suffices to get at most twice of the required diameter. Some of our results extend to the edge-weighted version of the problems.

[1]  Paul Erdös,et al.  How to decrease the diameter of triangle-free graphs , 1998, Comb..

[2]  Chung-Lun Li,et al.  On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems , 1992, Oper. Res. Lett..

[3]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[4]  J. Plesník.  On the computational complexity of centers locating in a graph , 1980 .

[5]  R. Balakrishnan,et al.  A textbook of graph theory , 1999 .

[6]  Victor Chepoi,et al.  Mixed Covering of Trees and the Augmentation Problem with Odd Diameter Constraints , 2005, Algorithmica.

[7]  Fan Chung Graham,et al.  Diameter bounds for altered graphs , 1984, J. Graph Theory.

[8]  Jan van Leeuwen,et al.  Diameter increase caused by edge deletion , 1987, J. Graph Theory.

[9]  Sanjeev Khanna,et al.  Design networks with bounded pairwise distance , 1999, STOC '99.

[10]  David B. Shmoys,et al.  A unified approach to approximation algorithms for bottleneck problems , 1986, JACM.

[11]  R. Chandrasekaran,et al.  Location on Tree Networks: P-Centre and n-Dispersion Problems , 1981, Math. Oper. Res..

[12]  Adam Meyerson,et al.  Minimizing Average Shortest Path Distances via Shortcut Edge Addition , 2009, APPROX-RANDOM.

[13]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[14]  S. L. HAKIMIt.  AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[15]  Ján Plesník,et al.  The complexity of designing a network with minimum diameter , 1981, Networks.

[16]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[17]  Sanjiv Kapoor,et al.  Bounded-Diameter Minimum-Cost Graph Problems , 2007, Theory of Computing Systems.

[18]  Hiroshi Nagamochi,et al.  Augmenting forests to meet odd diameter requirements , 2006, Discret. Optim..

[19]  Morteza Zadimoghaddam,et al.  Minimizing the Diameter of a Network Using Shortcut Edges , 2010, SWAT.

[20]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[21]  Victor Chepoi,et al.  Augmenting Trees to Meet Biconnectivity and Diameter Constraints , 2002, Algorithmica.

[22]  Noga Alon,et al.  Decreasing the diameter of bounded degree graphs , 2000 .

[23]  Elena Grigorescu,et al.  Decreasing the diameter of cycles , 2003 .