Approximating connectivity augmentation problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 176-185

  Nutov, Zeev ^a  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AUGMENTATION PROBLEMS; CONNECTIVITY AUGMENTATION PROBLEMS; NODES; POLYLOGARITHMIC APPROXIMATION;

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; GRAPH THEORY; POLYNOMIALS; SET THEORY;

PROBLEM SOLVING;

EID: 20744456146     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. J. Bang-Jensen and B. Jackson, Augmenting hyper-graphs with edges of size two, Math, Programming 84 (1999), 467-481.
2. A. Benczúr and A. Frank, Covering symmetric supermodular functions by graphs, Math. Program. 84 (1999), 483-503.
3. B. Cosh, B. Jackson, Z. Kiraly, Local connectivity augmentation in hypergraphs is NP-complete, manuscript.
4. G. R. Cai and R. G. Sun, The minimum augmentation of any graph to k-edge connected graph, Networks 19, 1988, 151-172.
5. J. Cheriyan, S. Vempala, and A. Vetta, Network design via iterative rounding of setpair relaxations, manuscript.
6. Ye. Dinitz and Z.Nutov, A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. STOC 1995, 509-518.
7. K. P. Eswaran and R. E. Tarjan, Augmentation problems, SIAM J. Comput. 5 (1976), 653-665.
8. A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM J. Disc. Math Vol. 5, No. 1, (1992), 25-53.
9. A. Frank, Connectivity augmentation problems in net-work design, in Mathematical Programming:State of the Art (1994), eds. J. R. Birge and K. G. Murty, 34-63.
10. A. Frank, Applications of relaxed submodularity, in: Proc. International Congress of Mathematicians, Berlin 1998, Vol. III: Invited Lectures, Documenta Mathematica, Extra Volume ICM 1998, eds. G. Fischer and U. Rehmann, 343-354.
11. A. Frank, Edge-connection of graphs, digraphs, and hypergraphs, Chapter 6, EGRES TR No 2001-11, July 2001.
12. A. Frank, On a theorem of Mader, Discrete mathematics 101, (1992), 49-57.
13. A. Frank and T. Jordan, Minimal edge-coverings of pairs of sets, J. Comb. Theory B 65, 1995, 73-110.
14. T. Fleiner and T. Jordan, Covering and structures of crossing families, in: Connectivity Augmentation of Networks: Structures and algorithms, Math. Programming (ed. A. Frank), Ser. B, Vol. 84, No. 3, 1999, 505-518.
15. L. Fleischer, K. Jain, D. P. Williamson, An Iterative Hounding 2-Approximation Algorithm for the Element Connectivity Problem, FOCS 2001, 339-347.
16. M. R. Garey and D. S. Johnson, Computers and intractability: a Guide to the Theory of NP-completeness, W. H. Freeman, San Francisco, 1979.
17. T. Hsu, Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation, in Proc. 6th International Symp. on Algorithms and Computation, LNCS 1004, 274-283, 1995.
18. K. Jain, A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem, Combinatorica 21 (1), 2001, 39-60.
19. B. Jackson and T. Jordan, Connectivity Augmentation of Graphs, Electronic Notes in Discrete Mathematics, Vol. 5 (July 2000).
20. B. Jackson and T. Jordan, A near optimal algorithm for vertex connectivity augmentation, LNCS 1969 (ISAAC 2000), 313-325.
21. B. Jackson and T. Jordan, Independence free graphs and vertex connectivity augmentation, LNCS 2081 (IPCO 2001) 264-279,
22. to appear in J. Comb. Theory Ser B.
23. V. Kann, Maximum bounded 3-dimensional matching is max snp-complete, Information Processing Letters, 37:27-35, 1991.
24. G. Kortsarz, R. Krauthgamer, and J. R. Lee, Hardness of approximation for vertex-connectivity network design problems, manuscript.
25. W. Mader, A reduction method for edge-connectivity in graphs, Ann. discrete Math 3, 1978, 145-164.
26. H. Nagamochi and T. Ishii, On the minimum local-vertex-connectivity augmentation in graphs, Discrete Applied Mathematics, Vol. 129, Issue 2-3, (2003), 475-486.
27. H. Nagamochi, Recent development of graph connectivity augmentation algorithms, IEICE Trans. Inf. and Syst. volE83-D 3, March 2000.
28. Z. Nutov, Approximating rooted connectivity augmentation problems, manuscript.
29. D. Peleg, Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems, in LNCS 1851, 2000, 220-230.
30. J. Plesnik, Minimum block containing a given graph, Archiv der Mathematik, Vol. XXVII (1976), Fasc. 6, 668-672.
31. Z. Szigeti, Hypergraph connectivity augmentation, Math. Program. 84 (1999), 519-527.
32. T. Watanabe and A. Nakamura, Edge-connectivity augmentation problems, Computer and System Sciences Vol. 35, No. 1 (1987), 96-144.