Approximating the smallest k-edge connected spanning...

Networks 2009 Vol. 53; Iss. 4

Approximating the smallest k-edge connected spanning subgraph by LP-rounding

Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
53
Year:
2009
Language:
english
Pages:
13
DOI:
10.1002/net.20289
File:
PDF, 196 KB
english, 2009
Conversion to is in progress
Conversion to is failed