Augmenting trees to meet biconnectivity and diameter constraints

Algorithmica (New York)

Volumn 33, Issue 2, 2002, Pages 243-262

  Chepoi, V ^a   Vaxes, Y ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Approximation algorithms; Biconnectivity augmentation; Diameter; Radius; Trees

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

BICONNECTIVITY;

COMPUTER SCIENCE;

EID: 0141922687     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0113-8     Document Type: Article

References (21)

1. S. Arora and M. Sudan, Improved low degree testing and its applications, in Proc. 29th ACM Symp. on Theory of Computing, (1997), pp. 485-495.
2. M. Bellare, S. Goldwasser, C. Lund, and A. Russell, Efficient multi-prover interactive proofs with applications to approximation problems, in Proc. 25th ACM Symp. on Theory of Computing (1993), pp. 113-131.
3. C. Berge, Hypergraphs, North-Holland, Amsterdam, 1989.
4. H. L. Bodlaender, Personal communication.
5. B. Bollobàs, Extremal Graph Theory, Academic Press, New York, 1978.
6. A. Brandstädt, V. Chepoi, and F. Dragan, The algorithmic use of hypertree structure and maximum neighbourhood orderings, Discrete Appl. Math. 82 (1998), 43-77.
7. R. Chandrasekaran and A. Daughety, Location on tree networks: p-center and g-dispersion problems, Math. Oper. Res. 6 (1981), 50-57.
8. G. J. Chang, Labeling algorithms for domination problems in sun-free chordal graphs, Discrete Appl. Math. 22 (1988/1989), 21-34.
9. K. P. Eswaran and R. E. Tarjan, Augmentation problems, SIAM J. Comput. 5 (1976), 653-665.
10. U. Feige, A threshold of In n for approximating set cover, J. Assoc. Comput. Mach. 45 (1998), 634-652.
11. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
12. T. S. Hsu and V. Ramachandran, On finding a minimum augmentation to biconnect a graph, SIAM J. Comput. 22 (1993), 889-891.
13. O. Kariv and S. L. Hakimi, An algorithmic approach to network location problems, I: the p-centers, SIAM J. Appl. Math. 37(3) (1979), 513-538.
14. S. Khuller, Approximation algorithms for finding highly connected subgraphs, in Approximation Algorithms for NP-Hard Problems (D. S. Hochbaum, ed.), PWS, Boston, MA, 1997, pp. 236-265.
15. S. Kutten and D. Peleg, Fast distributed construction of small k-dominating sets and applications, J. Algorithms 28 (1998), 40-66.
16. A. Laugier, Personal communication.
17. Ch.-L. Li, S. Th. McCormick, and D. Simchi-Levi, On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems, Oper. Res. Lett. 11 (1992), 303-308.
18. D. Peleg and E. Upfal, A tradeoff between size and efficiency of routing tables, J. Assoc. Comput. Mach. 36 (1989), 510-530.
19. R. Raz and S. Safra, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, in Proc. 29th ACM Symp. on Theory of Computing (1997), pp. 475-484.
20. A. Rosenthal and A. Goldner, Smallest augmentation to biconnect a graph, SIAM J. Comput. 6 (1977), 55-66.
21. A. A. Schoone, H. L. Bodlaender, and J. van Leeuwen, Diameter increase caused by edge deletion, J. Graph Theory 11 (1987), 409-427.