First Page | Document Content | |
---|---|---|
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 WebsiteFile Size: 364,32 KBShare Document on Facebook |