Fast Generation of Random Permutations Via Networks Simulation A. CzumajP. KanarekK. Lorys Pages: 2 - 20
Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal A. FriezeW. Szpankowski Pages: 21 - 36
Matching Convex Shapes with Respect to the Symmetric Difference H. AltU. FuchsG. Weber Pages: 89 - 103
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems N. AlonY. AzarG. J. Woeginger Pages: 104 - 118