What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs

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
> Publications > What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs