A (1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius

We consider the Tree Augmentation problem: given a graph G=(V,E) with edge-costs and a tree T on V disjoint to E, find a minimum-cost edge-subset F⊆E such that T∪F is 2-edge-connected. Tree Augmentation is equivalent to the problem of finding a minimum-cost edge-cover F⊆E of a laminar set-family. Th...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 489-490; s. 67 - 74
Hlavní autori:	Cohen, Nachshon, Nutov, Zeev
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 10.06.2013
Predmet:	Approximation algorithms Edge-connectivity Laminar family Local replacement Tree Augmentation Edge-connectivity Tree Augmentation Approximation algorithms Laminar family Local replacement
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!