The following pages link to Eden Chlamtáč (Q1799230):
Displaying 25 items.
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- Improved approximation of the minimum cover time (Q2566000) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- (Q2830866) (← links)
- Lift-and-Project Methods for Set Cover and Knapsack (Q2842162) (← links)
- Detecting high log-densities (Q2875146) (← links)
- New approximation guarantee for chromatic number (Q2931386) (← links)
- (Q2969610) (← links)
- Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
- The Densest $k$-Subhypergraph Problem (Q3174693) (← links)
- (Q3191570) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- Approximating Sparsest Cut in Graphs of Bounded Treewidth (Q3588403) (← links)
- Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds (Q4575771) (← links)
- Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion (Q4575795) (← links)
- Approximation Algorithms for Label Cover and The Log-Density Threshold (Q4575796) (← links)
- The Densest k-Subhypergraph Problem (Q4636436) (← links)
- Approximating Spanners and Directed Steiner Forest (Q4987451) (← links)
- (Q5009502) (← links)
- (Q5091190) (← links)
- Linear Index Coding via Semidefinite Programming (Q5410256) (← links)
- (Q5743408) (← links)
- (Q5875462) (← links)
- (Q6084397) (← links)
- Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods (Q6232565) (← links)