A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees (2000)
Cached
Download Links
- [www.aladdin.cs.cmu.edu]
- [www.andrew.cmu.edu]
- [www.gsia.cmu.edu]
- [www.andrew.cmu.edu]
- DBLP
Other Repositories/Bibliography
by
Jochen Könemann
,
R. Ravi
| Venue: | SIAM Journal on Computing |
| Citations: | 39 - 6 self |
BibTeX
@ARTICLE{Könemann00amatter,
author = {Jochen Könemann and R. Ravi},
title = {A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees},
journal = {SIAM Journal on Computing},
year = {2000},
volume = {31},
pages = {537--546}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A7 80 05 2B C D ; 84 6 E> 7 , 6 F,G < =3H 3D I: 7J ,F,G K L MON4P I: K L MN4P , 6 E : O Q 9 6 E7 , ,<= 2 = , ?6 ES8 6 Q9 , O Q 2OT , 3 O 6 US8 ; 6 Q 7 6 9 ,7 3 O , 6 79 82 1.
