Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs

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

Details

Publication typeInproceedings
Published in8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2005) and 9th International Workshop on Randomization and Computation (RANDOM 2005)
URLhttp://dx.doi.org/10.1007/11538462_3
Pages26-39
Volume3624
SeriesLecture Notes in Computer Science
AddressBerkeley, CA, USA
PublisherSpringer Verlag
> Publications > What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs