Augmenting Graphs to Minimize the Diameter

We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while minimizing the diameter of the augmented graph. Our main result is an FPT $$4$$4-approximation algorithm for the problem.

[1]  W. Marsden.  I and J , 2012 .

[2]  A. Rényii,et al.  ON A PROBLEM OF GRAPH THEORY , 1966 .

[3]  DistanceYevgeniy Dodis,et al.  Designing Networks with Bounded Pairwise Distance , 1999 .

[4]  Guido Proietti,et al.  Improved approximability and non-approximability results for graph diameter decreasing problems , 2010, Theor. Comput. Sci..

[5]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[6]  Michael L. Fredman,et al.  Trans-dichotomous algorithms for minimum spanning trees and shortest paths , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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

[8]  Dániel Marx,et al.  Parameterized Complexity and Approximation Algorithms , 2008, Comput. J..

[9]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[10]  Michael L. Fredman,et al.  Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths , 1994, J. Comput. Syst. Sci..

[11]  Yong Gao,et al.  The parametric complexity of graph diameter augmentation , 2013, Discret. Appl. Math..

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

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

[14]  Noga Alon,et al.  Decreasing the diameter of bounded degree graphs , 2000, J. Graph Theory.

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

[16]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[17]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[18]  Joachim Gudmundsson,et al.  Augmenting Graphs to Minimize the Diameter , 2013, ISAAC.

[19]  L FredmanMichael,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987 .

[20]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

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

[22]  Elena Grigorescu.  Decreasing the diameter of cycles , 2003, J. Graph Theory.

[23]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

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