Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions.

Zeev Nutov

Browse the full FOCS paper archive.