Highly Influenced

# Augmenting Trees to Meet Biconnectivity and Diameter Constraints

@article{Chepoi2001AugmentingTT, title={Augmenting Trees to Meet Biconnectivity and Diameter Constraints}, author={Victor Chepoi and Yann Vax{\`e}s}, journal={Algorithmica}, year={2001}, volume={33}, pages={243-262} }

- Published 2001 in Algorithmica
DOI:10.1007/s00453-001-0113-8

Given a graph G=(V,E) and a positive integer D , we consider the problem of finding a minimum number of new edges E' such that the augmented graph G'=(V,E\cup E') is biconnected and has diameter no greater than D. In this note we show that this problem is NP-hard for all fixed D , by employing a reduction from the DOMINATING SET problem. We prove that the problem remains NP-hard even for forests and trees, but in this case we present approximation algorithms with worst-case bounds 3 (for even D… CONTINUE READING

Highly Cited

This paper has 55 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

32 Citations

17 References

Similar Papers

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 55 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**55**citations based on the available data.See our **FAQ** for additional information.