R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III. Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. Algorithmica, 31(1):58-78, 2001. [doi]
@article{RaviMRRH01,
title = {Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems},
author = {R. Ravi and Madhav V. Marathe and S. S. Ravi and Daniel J. Rosenkrantz and Harry B. Hunt III},
year = {2001},
url = {http://link.springer.de/link/service/journals/00453/contents/01/0038/},
tags = {design},
researchr = {https://researchr.org/publication/RaviMRRH01},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {31},
number = {1},
pages = {58-78},
}