Augmenting graphs to minimize the diameter
Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson
TL;DR
This paper presents a fixed-parameter tractable 4-approximation algorithm for augmenting weighted graphs with additional edges of limited total cost to minimize their diameter.
Contribution
It introduces the first fixed-parameter tractable approximation algorithm for the graph augmentation problem targeting diameter reduction.
Findings
FPT 4-approximation algorithm developed
Efficient augmentation with bounded cost
Improved approach to diameter minimization
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Graph Theory Research · Optimization and Search Problems