Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
Multi-IMA Partition Scheduling for Global I/O Synchronization
Square grid points coveraged by
Combinatorial Auction. Conbinatorial auction t 1 =20 t 2 =15 t 3 =6 f(t): the set X F with the highest total value the mechanism decides the set of winners.
Subspace Embeddings for the L1 norm with Applications Christian Sohler David Woodruff TU Dortmund IBM Almaden.
Department of Computer Science and Engineering Defining and Computing Curve-skeletons with Medial Geodesic Function Tamal K. Dey and Jian Sun The Ohio.
Iterative Rounding and Iterative Relaxation Some of the slides prepared by Lap Chi Lau.
Truthful Mechanisms for Combinatorial Auctions with Subadditive Bidders Speaker: Shahar Dobzinski Based on joint works with Noam Nisan & Michael Schapira.
Minimizing Efficiency Loss in Mechanism and Protocol Design Tim Roughgarden (Stanford) includes joint work with: Shuchi Chawla (Wisconsin), Ho-Lin Chen.
LAW February 20071 A 5/3 approximation algorithm for a hard case of stable marriage Rob Irving Computing Science Department University of Glasgow (joint.
Multiagent Systems1 Truth Revelation in Approximately Efficient Combinatorial Auctions Daniel Lehman, Liadan Ita OCallaghan and Yoav Shoham @ Journal of.
Generating Realistic Terrains with Higher-Order Delaunay Triangulations Thierry de Kok Marc van Kreveld Maarten Löffler Center for Geometry, Imaging and.