LP-Relaxations for Tree Augmentation

Discrete Applied Mathematics, pp. 94-105, 2018.

Cited by: 11|Bibtex|Views25|Links
EI
Keywords:
Tree augmentationLP-relaxationLaminar familyApproximation algorithm

Abstract:

In the Tree Augmentation problem the goal is to augment a tree T by a minimum size edge set F from a given edge set E such that T∪F is 2-edge-connected. The best approximation ratio known for the problem is 1.5. In the more general Weighted Tree Augmentation problem, F should be of minimum weight. Weighted Tree Augmentation admits several...More

Code:

Data:

Your rating :
0

 

Tags
Comments