Approximating rooted connectivity augmentation problems

Algorithmica (New York)

Volumn 44, Issue 3, 2006, Pages 213-231

  Nutov, Zeev ^a  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

Approximation algorithms; Augmentation problems; Hardness of approximation; Rooted connectivity

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

APPROXIMATION ALGORITHMS; AUGMENTATION PROBLEMS; HARDNESS OF APPROXIMATION; ROOTED CONNECTIVITY;

APPROXIMATION THEORY;

EID: 32244437176     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-005-1150-5     Document Type: Article

References (14)

1. D. Bienstock, E. F. Brickell, and C. L. Monma, On the structure of minimum-weight K-connected spanning networks, SIAMJ. Discrete Math. 3 (1990), 320-329.
2. J. Cheriyan, T. Jordán, and Z. Nutov, On rooted node connectivity problems, Algorithmica 30 (2001), 353-375.
3. J. Cheriyan and R. Thurimella, Fast algorithms for K-shredders and K-node connectivity augmentation, J. Algorithms 33(1) (1999), 15-50.
4. A. Frank, Increasing the rooted connectivity of a digraph by one, Math. Program., 84(3) (1999), 565-576.
5. A. Frank and T. Jordan, Minimal edge-coverings of pairs of sets, J. Combin. Theory Ser. B 65 (1995), 73-110.
6. A. Frank and É. Tardos, An application of submodular flows, Linear Algebra Appl. 114/115 (1989), 329-348.
7. B. Jackson and T. Jordan, A near optimal algorithm for vertex connectivity augmentation, in Proc. ISAAC 2000, pp. 313-325, LNCS 1969, Springer-Verlag, Berlin, 2001.
8. B. Jackson and T. Jordan, Independence free graphs and vertex connectivity augmentation, in Proc. IPCO 2001, pp. 264-279, LNCS 2081, Springer-Verlag, Berlin, 2002.
9. To appear in J. Combin. Theory Ser. B.
10. T. Jordan, On the optimal vertex-connectivity augmentation, J. Combin. Theory Sci: B 63 (1995), 8-20.
11. T. Jordan, A note on the vertex connectivity augmentation, J. Combin. Theory Ser. B 71(2) (1997), 294-301.
12. G. Liberman and Z. Nutov, On shredders and vertex-connectivity augmentation. To appear in. J. Discrete Algorithms.
13. L. Lovász, On the ratio of optimal integral and fractional covers, Discrete Math. 13 (1975), 383-390.
14. 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, pp. 475-484, 1997.