Approximate Nash Equilibria in interesting games Constantinos Daskalakis, U.C. Berkeley.
bubeck_optimization
A Simple, Greedy Approximation Algorithm for MAX SAT David P. Williamson Joint work with Matthias Poloczek (Frankfurt, Cornell) and Anke van Zuylen (William.
Deterministic Wavelet Thresholding for Maximum-Error Metrics Minos Garofalakis Bell Laboratories Lucent Technologies 600 Mountain Avenue Murray Hill, NJ.
Benjamin Doerr Max-Planck-Institut für Informatik Saarbrücken Component-by-Component Construction of Low-Discrepancy Point Sets joint work with Michael.
Randomized Algorithms and Randomized Rounding Lecture 21: April 13 G n 2 leaves 0.30.60.2 0.70.4.
An Improved Approximation Algorithm for Combinatorial Auctions with Submodular Bidders.
Distributed Combinatorial Optimization. Abstract Approximating integer linear programs by solving a relaxation to a linear program (LP) and afterwards.
An Improved Approximation Algorithm for Combinatorial Auctions with Submodular Bidders
