Eden Chlamtác

According to our database, Eden Chlamtác authored at least 26 papers between 2005 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Approximating Red-Blue Set Cover.

Eden Chlamtác, Yury Makarychev, Ali Vakilian

CoRR, 2023

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

Eden Chlamtác, Yury Makarychev, Ali Vakilian

Proceedings of the Approximation, 2023

2022

Approximating Fair Clustering with Cascaded Norm Objectives.

Eden Chlamtác, Yury Makarychev, Ali Vakilian

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

2020

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

Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit

ACM Trans. Algorithms, 2020

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

Eden Chlamtác, Petr Kolman

Proceedings of the Approximation, 2020

2019

The Norms of Graph Spanners.

Eden Chlamtác, Michael Dinitz, Thomas Robinson

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

Approximating the Norms of Graph Spanners.

Eden Chlamtác, Michael Dinitz, Thomas Robinson

Proceedings of the Approximation, 2019

2018

The Densest k-Subhypergraph Problem.

Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca

SIAM J. Discret. Math., 2018

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

Eden Chlamtác, Zachary Friggstad, Konstantinos Georgiou

Algorithmica, 2018

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

Eden Chlamtác, Pasin Manurangsi

Proceedings of the Approximation, 2018

2017

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

Eden Chlamtác, 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.

Eden Chlamtác, Michael Dinitz, Yury Makarychev

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

2016

Lowest-Degree k-Spanner: Approximation and Hardness.

Eden Chlamtác, Michael Dinitz

Theory Comput., 2016

2014

Linear Index Coding via Semidefinite Programming.

Eden Chlamtac, Ishay Haviv

Comb. Probab. Comput., 2014

2013

Inapproximability of NP-Complete Variants of Nash Equilibrium.

Per Austrin, Mark Braverman, Eden Chlamtac

Theory Comput., 2013

2012

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

Eden Chlamtác, Zac Friggstad, Konstantinos Georgiou

CoRR, 2012

Everywhere-Sparse Spanners via Dense Subgraphs.

Eden Chlamtac, Michael Dinitz, 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

Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan

CoRR, 2010

Detecting high log-densities: an <i>O</i>(<i>n</i>^1/4) approximation for densest <i>k</i>-subgraph.

Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan

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

Approximating Sparsest Cut in Graphs of Bounded Treewidth.

Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra

Proceedings of the Approximation, 2010

2008

Efficient traversal of mesh edges using adjacency primitives.

Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugues Hoppe

ACM Trans. Graph., 2008

Improved Approximation Guarantees through Higher Levels of SDP Hierarchies.

Eden Chlamtac, Gyanit Singh

Proceedings of the Approximation, 2008

2007

Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations.

Eden Chlamtac

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

2006

New approximation guarantee for chromatic number.

Sanjeev Arora, Eden Chlamtac

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

How to Play Unique Games Using Embeddings.

Eden Chlamtac, Konstantin Makarychev, Yury Makarychev

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

2005

Improved approximation of the minimum cover time.

Eden Chlamtac, Uriel Feige

Theor. Comput. Sci., 2005