Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
Square grid points coveraged by
Arora: SDP + Approx Survey Semidefinite Programming and Approximation Algorithms for NP-hard Problems: A Survey Sanjeev Arora Princeton University .
Truthful Mechanisms for Combinatorial Auctions with Subadditive Bidders Speaker: Shahar Dobzinski Based on joint works with Noam Nisan & Michael Schapira.
On allocations that maximize fairness Uriel Feige Microsoft Research and Weizmann Institute.
Combinatorial Auctions with Complement-Free Bidders – An Overview Speaker: Michael Schapira Based on joint works with Shahar Dobzinski & Noam Nisan.
Alejandro Salinger University of Waterloo Joint work with Francisco Claude, Gautam K. Das, Reza Dorrigiv, Stephane Durocher, Robert Fraser, Alejandro López-Ortiz,
Improved Approximation for Orienting Mixed Graphs Iftah Gamzu CS Division, The Open Univ., and CS School, Tel-Aviv University Moti Medina EE School, Tel-Aviv.
A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions Tzvika Hartman Weizmann Institute.
Introduction to algorithmic aspect of auction theory
Spanning Tree
Inapproximability of MAX-CUT Khot,Kindler,Mossel and O ’ Donnell Moshe Ben Nehemia June 05.
