Eden Chlamtác

Ali Vakilian

CoRR, 2023

Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment.

[BibT_eX]

[DOI]

Ali Vakilian

Proceedings of the Approximation, 2023

2022

Approximating Fair Clustering with Cascaded Norm Objectives.

[BibT_eX]

[DOI]

Ali Vakilian

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2020

Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut.

[BibT_eX]

[DOI]

Petr Kolman

Proceedings of the Approximation, 2020

2019

The Norms of Graph Spanners.

[BibT_eX]

[DOI]

Thomas Robinson

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Approximating the Norms of Graph Spanners.

[BibT_eX]

[DOI]

Thomas Robinson

Proceedings of the Approximation, 2019

2018

The Densest k-Subhypergraph Problem.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Lift-and-Project Methods for Set Cover and Knapsack.

[BibT_eX]

[DOI]

Zachary Friggstad

Konstantinos Georgiou

Algorithmica, 2018

Sherali-Adams Integrality Gaps Matching the Log-Density Threshold.

[BibT_eX]

[DOI]

Pasin Manurangsi

Proceedings of the Approximation, 2018

2017

Approximation Algorithms for Label Cover and The Log-Density Threshold.

[BibT_eX]

[DOI]

Pasin Manurangsi

Dana Moshkovitz

Aravindan Vijayaraghavan

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Lowest-Degree k-Spanner: Approximation and Hardness.

[BibT_eX]

[DOI]

Theory Comput., 2016

2014

Linear Index Coding via Semidefinite Programming.

[BibT_eX]

[DOI]

Ishay Haviv

Comb. Probab. Comput., 2014

2013

Inapproximability of NP-Complete Variants of Nash Equilibrium.

[BibT_eX]

[DOI]

Per Austrin

Mark Braverman

Theory Comput., 2013

2012

Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods

[BibT_eX]

[DOI]

Zac Friggstad

Konstantinos Georgiou

CoRR, 2012

Everywhere-Sparse Spanners via Dense Subgraphs.

[BibT_eX]

[DOI]

Robert Krauthgamer

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2010

Detecting High Log-Densities -- an O(n^1/4) Approximation for Densest k-Subgraph

[BibT_eX]

[DOI]

Aravindan Vijayaraghavan

CoRR, 2010

Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph.

[BibT_eX]

[DOI]

Aravindan Vijayaraghavan

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Approximating Sparsest Cut in Graphs of Bounded Treewidth.

[BibT_eX]

[DOI]

Robert Krauthgamer

Prasad Raghavendra

Proceedings of the Approximation, 2010

2008

Efficient traversal of mesh edges using adjacency primitives.

[BibT_eX]

[DOI]

ACM Trans. Graph., 2008

Improved Approximation Guarantees through Higher Levels of SDP Hierarchies.

[BibT_eX]

[DOI]

Gyanit Singh

Proceedings of the Approximation, 2008

2007

Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006

New approximation guarantee for chromatic number.

[BibT_eX]

[DOI]

Sanjeev Arora

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

How to Play Unique Games Using Embeddings.

[BibT_eX]

[DOI]

Konstantin Makarychev

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

Improved approximation of the minimum cover time.

[BibT_eX]

[DOI]