Anke - PDFSEARCH.IO - Document Search Engine

Anke
Results: 405

#	Item
11	The Achilles Heel of the GSR-Shuffle ∗ A Note on New Age Solitaire Anke van Zuylen Frans Schalekamp Add to Reading List Source URL: arvanzuijlen.people.wm.edu - Date: 2010-09-17 07:14:44
12	Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems Anke van Zuylen? and David P. Williamson?? School of Operations Research and Information Engineering, Cornell University, Ithaca, NY Add to Reading List Source URL: arvanzuijlen.people.wm.edu - Date: 2010-09-17 07:13:30
13	An Upper Bound on the Number of Circular Transpositions to Sort a Permutation Anke van Zuylen∗, James Bieron, Frans Schalekamp, Gexin Yu1 Department of Mathematics, The College of William and Mary, Williamsburg, VA, 23 Add to Reading List Source URL: arvanzuijlen.people.wm.edu - Date: 2015-02-27 12:37:41
14	Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments Anke van Zuylen Institute for Theoretical Computer Science, Tsinghua University, Beijing, China Add to Reading List Source URL: arvanzuijlen.people.wm.edu - Date: 2010-09-17 07:14:26
15	Deterministic pivoting algorithms for constrained ranking and clustering problems Anke van Zuylen∗ Rajneesh Hegde† Add to Reading List Source URL: arvanzuijlen.people.wm.edu - Date: 2010-09-17 07:13:25
16	Popular Ranking Anke van Zuylen a Frans Schalekamp b David P. Williamson c,1 a Max-Planck-Institut f¨ ur Informatik, Saarbr¨ Add to Reading List Source URL: arvanzuijlen.people.wm.edu - Date: 2011-05-03 05:35:16
17	An improved monotone algorithm for scheduling related machines with precedence constraints Anke van Zuylen∗ Max Planck Institute for Informatics, Saarbr¨ ucken, Germany Add to Reading List Source URL: arvanzuijlen.people.wm.edu - Date: 2011-07-28 05:32:53
18	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 - Date: 2009-07-13 21:26:58
19	Improved Approximations for Cubic Bipartite and Cubic TSP Anke van Zuylen∗ Department of Mathematics The College of William and Mary, Williamsburg, VA, 23185, USA Add to Reading List Source URL: arvanzuijlen.people.wm.edu - Date: 2016-06-24 11:22:07
20	Deterministic Sampling Algorithms for Network Design Anke van Zuylen? School of Operations Research and Information Engineering, Cornell University, Ithaca, NYFax: (. Add to Reading List Source URL: arvanzuijlen.people.wm.edu - Date: 2010-09-17 07:13:54