The Densest $k$-Subhypergraph Problem von Chlamtáč, Eden, Dinitz, Michael, Konrad, Christian, Kortsarz, Guy, Rabanca, George

Volltext

Lift-and-Project Methods for Set Cover and Knapsack von Chlamtáč, Eden, Friggstad, Zachary, Georgiou, Konstantinos

Volltext

Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds von Chlamtáč, Eden, Dinitz, Michael, Kortsarz, Guy, Laekhanukit, Bundit

Volltext

Linear Index Coding via Semidefinite Programming von CHLAMTÁČ, EDEN, HAVIV, ISHAY

Volltext

Everywhere-Sparse Spanners via Dense Subgraphs von Chlamtác, E., Dinitz, M., Krauthgamer, R.

Volltext

Efficient traversal of mesh edges using adjacency primitives von Sander, Pedro V., Nehab, Diego, Chlamtac, Eden, Hoppe, Hugues

Volltext

Improved Approximation Guarantees through Higher Levels of SDP Hierarchies von Chlamtac, Eden, Singh, Gyanit

Volltext

Approximating Sparsest Cut in Graphs of Bounded Treewidth von Chlamtac, Eden, Krauthgamer, Robert, Raghavendra, Prasad

Volltext

Improved approximation of the minimum cover time von Chlamtac, Eden, Feige, Uriel

Volltext

Linear Index Coding via Semidefinite Programming von Chlamtac, Eden, Haviv, Ishay

Volltext bestellen

Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment von Chlamtáč, Eden, Makarychev, Yury, Vakilian, Ali

Volltext bestellen

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering von Bandyapadhyay, Sayan, Chlamtáč, Eden, Makarychev, Yury, Vakilian, Ali

Volltext bestellen

Everywhere-Sparse Spanners via Dense Subgraphs von Chlamtac, Eden, Dinitz, Michael, Krauthgamer, Robert

Volltext bestellen

Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods von Chlamtac, Eden, Friggstad, Zac, Georgiou, Konstantinos

Volltext bestellen

Linear Index Coding via Semidefinite Programming von Eden Chlamtac, Haviv, Ishay

Volltext

Approximating Fair Clustering with Cascaded Norm Objectives von Chlamtáč, Eden, Makarychev, Yury, Vakilian, Ali

Volltext bestellen

Inapproximability of NP-Complete Variants of Nash Equilibrium von Austrin, Per, Braverman, Mark, Chlamtac, Eden

Volltext bestellen

Sherali-Adams Integrality Gaps Matching the Log-Density Threshold von Chlamtáč, Eden, Manurangsi, Pasin

Volltext bestellen

How to Play Unique Games Using Embeddings von Chlamtac, E., Makarychev, K., Makarychev, Y.

Volltext

Approximating Sparsest Cut in Graphs of Bounded Treewidth von Chlamtac, Eden, Krauthgamer, Robert, Raghavendra, Prasad

Volltext bestellen