A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees

Jochen Könemann, R. Ravi. A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. In STOC. pages 537-546, 2000. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.