A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Jochen Könemann, R. Ravi
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
STOC, 2000.

STOC 2000
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2000-KonemannR,
	author        = "Jochen Könemann and R. Ravi",
	booktitle     = "{Proceedings of the 32nd Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/335305.335371",
	isbn          = "1-58113-184-4",
	pages         = "537--546",
	publisher     = "{ACM}",
	title         = "{A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees}",
	year          = 2000,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.