Work

Augmenting graphs to minimize the diameter

Year: 2013

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1309.5172

Authors: Frati, Fabrizio, Gaspers, Serge, Gudmundsson, Joachim, Mathieson, Luke

Institutions: The University of Sydney, UNSW Sydney, Data61, Macquarie University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Australian Government

OpenAlex ID: W2950629413

Cites: 14

Cited by: 2

Related to: 20