A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs

Yefim Dinitz, Zeev Nutov. A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs. J. Algorithms, 32(1):31-40, 1999.

@article{DinitzN99,
  title = {A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs},
  author = {Yefim Dinitz and Zeev Nutov},
  year = {1999},
  researchr = {https://researchr.org/publication/DinitzN99},
  cites = {0},
  citedby = {0},
  journal = {J. Algorithms},
  volume = {32},
  number = {1},
  pages = {31-40},
}