Improved Algorithm for Degree Bounded Survivable Network Design Problem

Anand Louis, Nisheeth K. Vishnoi. Improved Algorithm for Degree Bounded Survivable Network Design Problem. In Haim Kaplan, editor, Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings. Volume 6139 of Lecture Notes in Computer Science, pages 408-419, Springer, 2010. [doi]

@inproceedings{LouisV10,
  title = {Improved Algorithm for Degree Bounded Survivable Network Design Problem},
  author = {Anand Louis and Nisheeth K. Vishnoi},
  year = {2010},
  doi = {10.1007/978-3-642-13731-0_38},
  url = {http://dx.doi.org/10.1007/978-3-642-13731-0_38},
  tags = {design},
  researchr = {https://researchr.org/publication/LouisV10},
  cites = {0},
  citedby = {0},
  pages = {408-419},
  booktitle = {Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
  editor = {Haim Kaplan},
  volume = {6139},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-13730-3},
}