![](https://www.pdfsearch.io/img/e2c70730e69d2ba45588c7c0ffd712cb.jpg) Date: 2009-07-13 21:26:58
| | Deterministic Sampling Algorithms for Network Design Anke van Zuylen Abstract For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called SampleAdd to Reading ListSource URL: arvanzuijlen.people.wm.eduDownload Document from Source Website File Size: 364,32 KBShare Document on Facebook
|