Microsoft Research
Microsoft Translator |
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs

Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, and Kunal Talwar
August 2005

14-fulltext.pdf
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

TypeInproceedings
URLhttp://dx.doi.org/10.1007/11538462_3
Pages26-39
Volume3624
SeriesLecture Notes in Computer Science
AddressBerkeley, CA, USA
Share
Share this page on Facebook
Share this page on Twitter
Share this page on LinkedIn
E-mail this page
RSS feeds
> Publications > What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs