Skip to main content
Conference Proceedings

Factor 4/3 approximations for minimum 2-connected subgraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1913 262-273
DOI: 10.1007/3-540-44436-x_26
40Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present factor 4/3 approximation algorithms for the problems of finding theminimum 2-edge connected and theminimum 2-vertex connected spanning subgraph of a given undirected graph.

Cite

CITATION STYLE

APA

Vempala, S., & Vetta, A. (2000). Factor 4/3 approximations for minimum 2-connected subgraphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1913, pp. 262–273). Springer Verlag. https://doi.org/10.1007/3-540-44436-x_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free