David P. Williamson
Home
Posts
Publications
Talks
Courses
Contact
CV
Harold N. Gabow
Latest
Approximating the smallest $k$-edge connected spanning subgraph by LP-rounding.
An Efficient Approximation Algorithm for the Survivable Network Design Problem.
Cite
×