What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs
Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, and Kunal Talwar
August 2005
 PDF file |
In: 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2005) and 9th International Workshop on Randomization and Computation (RANDOM 2005)
Publisher: Springer Verlag
All copyrights reserved by Springer 2007.
Details
| Type: | Inproceedings |
| URL: | http://dx.doi.org/10.1007/11538462_3 |
| Pages: | 26-39 |
| Volume: | 3624 |
| Series: | Lecture Notes in Computer Science |
| Address: | Berkeley, CA, USA |
©2009 Microsoft Corporation. All rights reserved.