Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

R. Ravi 0001, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. In S. S. Ravi, Sandeep K. Shukla, editors, Fundamental Problems in Computing, Essays in Honor of Professor Daniel J. Rosenkrantz. pages 241-266, Springer, 2013. [doi]

@inproceedings{0001MRRH13,
  title = {Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems},
  author = {R. Ravi 0001 and Madhav V. Marathe and S. S. Ravi and Daniel J. Rosenkrantz and Harry B. Hunt III},
  year = {2013},
  doi = {10.1007/978-1-4020-9688-4_9},
  url = {https://doi.org/10.1007/978-1-4020-9688-4_9},
  researchr = {https://researchr.org/publication/0001MRRH13},
  cites = {0},
  citedby = {0},
  pages = {241-266},
  booktitle = {Fundamental Problems in Computing, Essays in Honor of Professor Daniel J. Rosenkrantz},
  editor = {S. S. Ravi and Sandeep K. Shukla},
  publisher = {Springer},
  isbn = {978-1-4020-9687-7},
}