English

Augmenting graphs to minimize the diameter

Data Structures and Algorithms 2013-09-23 v1
Authors: Fabrizio Frati , Serge Gaspers , Joachim Gudmundsson , Luke Mathieson
View on arXiv ↗ PDF ↗

Abstract

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-approximation algorithm for the problem.

Keywords

graph algorithms graph spanners graph theory

Cite

@article{arxiv.1309.5172,
  title  = {Augmenting graphs to minimize the diameter},
  author = {Fabrizio Frati and Serge Gaspers and Joachim Gudmundsson and Luke Mathieson},
  journal= {arXiv preprint arXiv:1309.5172},
  year   = {2013}
}

Comments

15 pages, 3 figures

Related papers

View all related →
Data Structures and Algorithms · Computer Science
Diameter Minimization by Shortcutting with Degree Constraints
Florian Adriaens, Aristides Gionis
2023-02-14
Data Structures and Algorithms · Computer Science
Engineering Weighted Connectivity Augmentation Algorithms
Marcelo Fonseca Faraj, Ernestine Großmann, Felix Joos, Thomas Möller +1
2024-02-13
Computational Geometry · Computer Science
Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees
Ulrike Große, Joachim Gudmundsson, Christian Knauer, Michiel Smid +1
2016-07-20
Combinatorics · Mathematics
Budget-constrained cut problems
Justo Puerto, José L. Sainz-Pardo
2023-08-15
Data Structures and Algorithms · Computer Science
An Improved Approximation Algorithm for the Matching Augmentation Problem
J. Cheriyan, R. Cummings, J. Dippel, J. Zhu
2020-12-14
Data Structures and Algorithms · Computer Science
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
Eyal Weiss, Ariel Felner, Gal A. Kaminka
2024-02-20
Discrete Mathematics · Computer Science
A note on the hardness of graph diameter augmentation problems
James Nastos, Yong Gao
2009-09-23
Data Structures and Algorithms · Computer Science
Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
Ryoma Norose, Yutaro Yamaguchi
2024-09-19
Data Structures and Algorithms · Computer Science
Approximation Algorithms for Budget Constrained Network Upgradeable Problems
Debjyoti Saharoy, Sandeep Sen
2014-12-12
Data Structures and Algorithms · Computer Science
A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space
Christopher Johnson, Haitao Wang
2019-04-30
Discrete Mathematics · Computer Science
Multivariate Exploration of Metric Dilation
Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +2
2025-01-09
Data Structures and Algorithms · Computer Science
The Matching Augmentation Problem: A $\frac74$-Approximation Algorithm
Joe Cheriyan, Jack Dippel, Fabrizio Grandoni, Arindam Khan +1
2019-04-24
Data Structures and Algorithms · Computer Science
An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space
Haitao Wang
2016-08-17
Data Structures and Algorithms · Computer Science
Preventing Small $\mathbf{(s,t)}$-Cuts by Protecting Edges
Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer
2021-07-12
Computational Geometry · Computer Science
Improving the average dilation of a metric graph by adding edges
Sariel Har-Peled, Eliot W. Robson
2025-06-06
Combinatorics · Mathematics
The effect of adding randomly weighted edges
Alan Frieze
2026-04-06
Discrete Mathematics · Computer Science
Node-balancing by edge-increments
Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella
2015-07-03
Combinatorics · Mathematics
Complexity and algorithms for constant diameter augmentation problems
Eun Jung Kim, Martin Milanic, Jérôme Monnot, Christophe Picouleau
2020-10-02
Data Structures and Algorithms · Computer Science
Improved Approximation Algorithms for the Expanding Search Problem
Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior
2025-05-13
Data Structures and Algorithms · Computer Science
A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space
Haitao Wang, Yiming Zhao
2020-06-26
Data Structures and Algorithms · Computer Science
Node Connectivity Augmentation of Highly Connected Graphs
Waldo Galvez, Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanita
2023-11-29
Combinatorics · Mathematics
Finding Weighted Graphs by Combinatorial Search
Jeong Han Kim
2012-01-19
Data Structures and Algorithms · Computer Science
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs
Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen
2012-12-13
Distributed, Parallel, and Cluster Computing · Computer Science
Distributed Weighted Matching via Randomized Composable Coresets
Sepehr Assadi, MohammadHossein Bateni, Vahab Mirrokni
2019-06-06
Discrete Mathematics · Computer Science
The Cost of Perfection for Matchings in Graphs
Emilio Vital Brazil, Guilherme D. da Fonseca, Celina de Figueiredo, Diana Sasaki
2018-11-08
R2 v1 2026-06-22T01:30:45.503Z