Eden Chlamtác

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