Approximating k-outconnected subgraph problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1444, Issue , 1998, Pages 77-88

  Cheriyan, Joseph ^a   Jordàn, Tibor ^b   Nutov, Zeev ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COSTS; OPTIMIZATION;

IN NETWORKS; METRIC COST; MULTIPLE ROOTS; SUBGRAPH PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 0002395698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0053965     Document Type: Conference Paper

References (13)

1. D. Bienstock, E. F. Brickell and C. L. Monma, "On the structure of minimum-weight k-connected spanning networks," SIAM J. Discrete Math. 3 (1990), 320-329.
2. B. Bollobàs, Extremal Graph Theory, Academic Press, London, 1978.
3. J. Cheriyan and R. Thurimella, "Approximating minimum-size k-connected spanning subgraphs via matching," manuscript, Sept. 1996. ECCC TR98-025, see http://www.eccc.uni-trier.de/eccc-local/Lists/TR-1998.html. Preliminary version in Proe. 37th IEEE FOCS (1996), 292-301.
4. A. Frank and E. Tardos, "An application of submodular flows," Linear Algebra and its Applications, 114/115 (1989), 320-348.
5. G.L. Frederickson and J. Ja’Ja’, "On the relationship between the bicoimectivity augmentation and traveling salesman problems," Theor. Comp. Sci. 19 (1982), 189-201.
6. H. N. Gabow and R. E. Tarjan, "Faster scaling algorithms for general graph matching problems," Journal of the ACM 38 (1991), 815-853.
7. T. Jordàn "On the optimal vertex-connectivity augmentation," J. Combinatorial Theory, Series B 63 (1995), 8-20.
8. S. KhuUer, "Approximation algorithms for finding highly connected subgraphs," in Approximation algorithms for NP-hard problems, Ed. D. S. Hochbaum, PWS publishing co., Boston, 1996.
9. S. Khuller and B. Raghavachari, "Improved approximation algorithms for uniform connectivity problems," Journal of Algorithms 21 (1996), 434-450.
10. W. Mader, "Ecken vom Grad n in minimalen n-fach zusammenhsängenden Graphen," Archive der Mathematik 23 (1972), 219-224.
11. H. Nagamoehi and T. Ibaraki, "A linear-time algorithm for finding a sparse kconnected spanning subgraph of a k-connected graph," Algorithmica 7 (1992), 583-596.
12. Z. Nutov, M. Penn and D. Siureich, "On mobile robots flow in locally uniform networks," Canadian Journal of Information Systems and Operational Research 35 (1997), 197-208.
13. R. Ravi and D. P. Williamson, "An approximation algorithm for minimum-cost vertex-connectivity problems." Algorithmica (1997) 18: 21-43.