Skip to main content
Conference Proceedings

Augmenting graphs to minimize the diameter

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 8283 LNCS 383-393
DOI: 10.1007/978-3-642-45030-3_36
4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Frati, F., Gaspers, S., Gudmundsson, J., & Mathieson, L. (2013). Augmenting graphs to minimize the diameter. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8283 LNCS, pp. 383–393). https://doi.org/10.1007/978-3-642-45030-3_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free