Simpler and better approximation algorithms for network design (original) (raw)
2003
visibility
…
description
8 pages
link
1 file
We give simple and easy-to-analyze randomized approximation algorithms for several well-studied NP-hard network design problems. Our algorithms improve over the previously best known approximation ratios. Our main results are the following.