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 Sample

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 Sample Add to Reading List Source URL: arvanzuijlen.people.wm.edu Download Document from Source Website File Size: 364,32 KB Share Document on Facebook