Magen, Avner - Department of Computer Science, University of Toronto

Advanced Search

Magen, Avner - Department of Computer Science, University of Toronto

Robust algorithms for Max Independent Set on Minor-free graphs based on the Sherali-Adams
Rank Bounds and Integrality Gaps for Cutting Planes Procedures Josh BureshOppenheim \Lambda
On-Line Algorithms for Market Equilibria Spyros Angelopoulos Atish Das Sarma Avner Magen Anastasios Viglas
Dimensionality Reductions that Preserve Volumes and Distance to Ane Spaces, and their Algorithmic Applications
Girth and Euclidean Distortion Nathan Linial Avner Magen y Assaf Naor z
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
Sublinear Geometric Algorithms # Bernard Chazelle
A Sublinear Algorithm for Weakly Approximating Edit gkan Batu
Trees and Euclidean metrics Nathan Linial \Lambda Avner Magen y Michael E. Saks z
Vertex Cover resists SDPs tightened by local hypermetric inequalities
How well can Primal-Dual and Local-Ratio algorithms perform?
Toward a Model for Backtracking and Dynamic Programming Michael Alekhnovich Allan Borodin y Joshua Buresh-Oppenheim z
THEORY OF COMPUTING, Volume 0 (2005), pp. 78100 http://theoryofcomputing.org
On the nonexistence of dimension reduction for 2 Avner Magen
Integrality gaps of semidefinite programs for Vertex Cover and relations to 1 embeddability
How well can Primal-Dual and Local-Ratio algorithms perform?
Metric embeddings beyond one-dimensional distortion Robert Krauthgamer
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
Embedding Hamming-metric of Boxes into L 2 Avner Magen
Girth and Euclidean Distortion Nathan Linial Avner Magen y Assaf Naor z
On-Line Algorithms for Market Equilibria Spyros Angelopoulos
Low distortion Euclidean embeddings of trees Nathan Linial Avner Magen y Michael E. Saks z
Optimal Sherali-Adams Gaps from Pairwise Independence Konstantinos Georgiou
Simple Permutations Mix Well Shlomo Hoory Avner Magen Steve Myers Charles Racko
Least-Distortion Euclidean Embeddings Of Graphs: Products of Cycles And Expanders
Integrality gaps of semidefinite programs for Vertex Cover and relations to # 1 embeddability