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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of graph theory Ročník 74; číslo 4; s. 392 - 416
Hlavný autor:	Ishii, Toshimasa
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken Blackwell Publishing Ltd 01.12.2013 Wiley Subscription Services, Inc
Predmet:	Algorithms constant factor approximation algorithm Decision trees diameter graph augmentation problem outerplanar graphs partial 2-trees undirected graph
ISSN:	0364-9024, 1097-0118
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!