Augmenting graphs to minimize the diameter

Frati, F; Gaspers, S; Gudmundsson, J; Mathieson, L

Augmenting graphs to minimize the diameter

Frati, F Gaspers, S Gudmundsson, J Mathieson, L

Permalink

Publication Type:: Journal Article
Citation:: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, 8283 LNCS pp. 383 - 393
Issue Date:: 2013-12-01

Closed Access

	Filename	Description	Size
	10.1007_978-3-642-45030-3_36.pdf	Published Version	308.89 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Frati, F	en_US
dc.contributor.author	Gaspers, S	en_US
dc.contributor.author	Gudmundsson, J	en_US
dc.contributor.author	Mathieson, L https://orcid.org/0000-0001-6470-2296	en_US
dc.date.issued	2013-12-01	en_US
dc.identifier.citation	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013, 8283 LNCS pp. 383 - 393	en_US
dc.identifier.isbn	9783642450297	en_US
dc.identifier.issn	0302-9743	en_US
dc.identifier.uri	http://hdl.handle.net/10453/93133
dc.description.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.	en_US
dc.relation.ispartof	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en_US
dc.relation.isbasedon	10.1007/978-3-642-45030-3_36	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Augmenting graphs to minimize the diameter	en_US
dc.type	Journal Article
utslib.citation.volume	8283 LNCS	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	8283 LNCS	en_US

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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/93133