Eden Chlamtác

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 22

Top Topics

Greedy Heuristic

Approximation Algorithms

Top Venues

Publications

Sayan Bandyapadhyay, Eden Chlamtác, Yury Makarychev, Ali Vakilian
A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering. CoRR (2024)
Eden Chlamtác, Yury Makarychev, Ali Vakilian
Approximating Red-Blue Set Cover. CoRR (2023)
Eden Chlamtác, Yury Makarychev, Ali Vakilian
Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment. APPROX/RANDOM (2023)
Eden Chlamtác, Yury Makarychev, Ali Vakilian
Approximating Fair Clustering with Cascaded Norm Objectives. SODA (2022)
Eden Chlamtác, Yury Makarychev, Ali Vakilian
Approximating Fair Clustering with Cascaded Norm Objectives. CoRR (2021)
Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. ACM Trans. Algorithms 16 (3) (2020)
Eden Chlamtác, Petr Kolman
How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut. APPROX-RANDOM (2020)
Eden Chlamtác, Michael Dinitz, Thomas Robinson
The Norms of Graph Spanners. CoRR (2019)
Eden Chlamtác, Michael Dinitz, Thomas Robinson
The Norms of Graph Spanners. ICALP (2019)
Eden Chlamtác, Michael Dinitz, Thomas Robinson
Approximating the Norms of Graph Spanners. APPROX-RANDOM (2019)
Eden Chlamtác, Zachary Friggstad, Konstantinos Georgiou
Lift-and-Project Methods for Set Cover and Knapsack. Algorithmica 80 (12) (2018)
Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca
The Densest k-Subhypergraph Problem. SIAM J. Discret. Math. 32 (2) (2018)
Eden Chlamtác, Pasin Manurangsi
Sherali-Adams Integrality Gaps Matching the Log-Density Threshold. CoRR (2018)
Eden Chlamtác, Pasin Manurangsi
Sherali-Adams Integrality Gaps Matching the Log-Density Threshold. APPROX-RANDOM (2018)
Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. SODA (2017)
Eden Chlamtác, Michael Dinitz, Yury Makarychev
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion. SODA (2017)
Eden Chlamtác, Pasin Manurangsi, Dana Moshkovitz, Aravindan Vijayaraghavan
Approximation Algorithms for Label Cover and The Log-Density Threshold. SODA (2017)
Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca
The Densest k-Subhypergraph Problem. CoRR (2016)
Eden Chlamtác, Michael Dinitz, Yury Makarychev
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion. CoRR (2016)
Eden Chlamtác, Michael Dinitz
Lowest-Degree k-Spanner: Approximation and Hardness. Theory Comput. 12 (1) (2016)
Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. CoRR (2016)
Eden Chlamtác, Michael Dinitz, Christian Konrad, Guy Kortsarz, George Rabanca
The Densest k-Subhypergraph Problem. APPROX-RANDOM (2016)
Eden Chlamtác, Michael Dinitz
Lowest Degree k-Spanner: Approximation and Hardness. APPROX-RANDOM (2014)
Eden Chlamtác, Zachary Friggstad, Konstantinos Georgiou
Lift-and-Project Methods for Set Cover and Knapsack. WADS (2013)
Eden Chlamtác, Zac Friggstad, Konstantinos Georgiou
Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods CoRR (2012)