Back to Results
First PageMeta Content



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

Document Date: 2009-07-13 21:26:58


Open Document

File Size: 364,32 KB

Share Result on Facebook
UPDATE