Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STOC
/
Paper
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees.
Jochen Knemann
,
R. Ravi
Venue
A*
STOC
Year
2000
Proceedings
STOC
DBLP record
conf/stoc/KonemannR00 ↗
Browse the full
STOC paper archive
.