Approximating the smallest ::::k::::-edge connected spanning subgraph by LP-rounding

Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson. Approximating the smallest ::::k::::-edge connected spanning subgraph by LP-rounding. Networks, 53(4):345-357, 2009. [doi]

@article{GabowGTW09,
  title = {Approximating the smallest ::::k::::-edge connected spanning subgraph by LP-rounding},
  author = {Harold N. Gabow and Michel X. Goemans and Éva Tardos and David P. Williamson},
  year = {2009},
  doi = {10.1002/net.20289},
  url = {http://dx.doi.org/10.1002/net.20289},
  researchr = {https://researchr.org/publication/GabowGTW09},
  cites = {0},
  citedby = {0},
  journal = {Networks},
  volume = {53},
  number = {4},
  pages = {345-357},
}