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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 489-490; pp. 67 - 74
Main Authors:	Cohen, Nachshon, Nutov, Zeev
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 10.06.2013
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!