Better algorithms for minimum weight vertex-connectivity problems

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

Volumn 1200, Issue , 1997, Pages 547-558

  Auletta, Vincenzo ^a   Parente, Mimmo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

BEST APPROXIMATIONS; K-VERTEX CONNECTED GRAPHS; MINIMUM WEIGHT; NP-HARD; SUBGRAPHS; VERTEX CONNECTIVITY;

APPROXIMATION ALGORITHMS;

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

References (12)

1. B. Bollobás Extremal Graph Theory, Academic Press, London, 1978.
2. Y. Dinitz, Z. Nutov, Finding minimum weight k-vertex connected spanning subgraphs: approximation algorithms with factor 2 for k - 3 and factor 3 for k = 4,5, TR-CS0886, Technion, Israel, 1996. (Also to appear in the proceedings of CIAC '97.)
3. K.P. Eswaran, R.E. Tarjan, Augmentations Problems, SIAM Jour, on Computing, (5), 4, 653-665, (1976).
4. A. Frank, E. Tardos, An application of Submodular Flows, Linear Algebra and its Applications 114/115, 329-348, (1989).
5. G. N. Frederickson, J. JáJá, On the relationship between the biconnectivity augmentation and travelling salesman problem Theoretical Computer Science, 19(2), 189-201, (1982).
6. H. N. Gabow, A representation for Crossing Set Families with Applications to Sub-modular Flow Problems, in Proc. of Symposium On Discrete Algorithms, SODA '93, 202-211, (1993).
7. M. R. Garey, D.S. Johnson, Computers and Intractability, Freeman, New York, 1979.
8. M. Grötschel, C. Monma, M. Stoer, Design of survivable networks, Handbook in Operations Research and Management Science, Volume on Networks, 1993.
9. S. Khuller, B. Raghavachari, Improved Approximation Algorithms for Uniform Connectivity Problems, in Proc. of Symposium on the Theory of Computing, STOC '95, 1-10, (1995).
10. S. Khuller, R. Thurimella, Approximation Algorithms for Graph Augmentation, J. of Algorithms 14, 214-225, (1993).
11. M. Penn, H. Shasha-Krupnik, Improved Approximation Algorithms for Weighted 2 & 3 Vertex Connectivity Augmentation Problems, Manuscript, (to appear on J. of Algorithms).
12. R. Ravi, D.P. Williamson, An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems, in Proc. of Symposium On Discrete Algorithms, SODA '95, 332-341, (1995).