Augmenting Trees to Meet Biconnectivity and Diameter Constraints

Given a graph G=(V,E) and a positive integer D , we consider the problem of finding a minimum number of new edges E' such that the augmented graph G'=(V,E\cup E') is biconnected and has diameter no greater than D. In this note we show that this problem is NP-hard for all fixed D , by employing a reduction from the DOMINATING SET problem. We prove that the problem remains NP-hard even for forests and trees, but in this case we present approximation algorithms with worst-case bounds 3 (for even D ) and 6 (for odd D ). A closely related problem of finding a minimum number of edges such that the augmented graph has diameter no greater than D has been shown to be NP-hard by Schoone et al. [21] when D=3 , and by Li et al. [17] when D=2.

[1]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[2]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[3]  S. Khuller.  Approximation algorithms for finding highly connected subgraphs , 1996 .

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

[5]  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.

[6]  Gerard J. Chang,et al.  Labeling algorithms for domination problems in sun-free chordal graphs , 1988, Discret. Appl. Math..

[7]  Arnie Rosenthal,et al.  Smallest Augmentations to Biconnect a Graph , 1977, SIAM J. Comput..

[8]  Elsev Iek.  The algorithmic use of hypertree structure and maximum neighbourhood orderings , 2003 .

[9]  Frank Harary,et al.  Graph Theory , 2016 .

[10]  KuttenShay,et al.  Fast Distributed Construction of Smallk-Dominating Sets and Applications , 1998 .

[11]  Shay Kutten,et al.  Fast Distributed Construction of Small k-Dominating Sets and Applications , 1998, J. Algorithms.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Tsan-sheng Hsu,et al.  Finding a Smallest Augmentation to Biconnect a Graph , 1993, SIAM J. Comput..

[14]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 2003, Comb..

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

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

[17]  Eli Upfal,et al.  A trade-off between space and efficiency for routing tables , 1989, JACM.

[18]  Robert E. Tarjan,et al.  Augmentation Problems , 1976, SIAM J. Comput..