Augmenting Outerplanar Graphs to Meet Diameter Requirements

Given an undirected graph G=(V,E) and an integer D≥1, we consider the problem of augmenting G by a minimum set of new edges so that the diameter becomes at most D. It is known that no constant factor approximation algorithms to this problem with an arbitrary graph G can be obtained unless P=NP, whil...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of graph theory Vol. 74; no. 4; pp. 392 - 416
Main Author:	Ishii, Toshimasa
Format:	Journal Article
Language:	English
Published:	Hoboken Blackwell Publishing Ltd 01.12.2013 Wiley Subscription Services, Inc
Subjects:	Algorithms constant factor approximation algorithm Decision trees diameter graph augmentation problem outerplanar graphs partial 2-trees undirected graph
ISSN:	0364-9024, 1097-0118
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!