#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2005

2017

- This year (3)
- Last 5 years (7)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sanjeev Arora, Eden Chlamtác
- STOC
- 2006

We describe how to color every 3-colorable graph with O(n<sup>0.2111</sup>) colors, thus improving an algorithm of Blum and Karger from almost a decade ago. Our analysis uses new geometric ideas… (More)

In the Densest k-Subgraph problem, given a graph G and a parameter k, one needs to find a subgraph of G induced on k vertices that contains the largest number of edges. There is a significant gap… (More)

- Eden Chlamtác, Konstantin Makarychev, Yury Makarychev
- 2006 47th Annual IEEE Symposium on Foundations of…
- 2006

In this paper we present a new approximation algorithm for unique games. For a unique game with n vertices and k states (labels), if a (1 - epsiv) fraction of all constraints is satisfiable, the… (More)

We discuss the effectiveness of linear and semidefinite relaxations in approximating the optimum for combinatorial optimization problems. Various hierarchies of these relaxations, such as the ones… (More)

- Eden Chlamtác
- 48th Annual IEEE Symposium on Foundations of…
- 2007

We. introduce, a framework for studying semidefiniie programming (SOP) relaxations based on the Lasserre hierarchy in the context of approximation algorithms for combinatorial problems. As an… (More)

- Per Austrin, Mark Braverman, Eden Chlamtác
- APPROX-RANDOM
- 2011

In recent work of Hazan and Krauthgamer (SICOMP 2011), it was shown that finding an ε-approximate Nash equilibrium with near-optimal value in a two-player game is as hard as finding a hidden clique… (More)

- Eden Chlamtác, Gyanit Singh
- APPROX-RANDOM
- 2008

For every fixed γ ≥ 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size γn, finds an independent set of size n 2). This improves upon a recent… (More)

- Pedro V. Sander, Diego F. Nehab, Eden Chlamtác, Hugues Hoppe
- ACM Trans. Graph.
- 2008

Processing of mesh edges lies at the core of many advanced realtime rendering techniques, ranging from shadow and silhouette computations, to motion blur and fur rendering. We present a scheme for… (More)

- Eden Chlamtác, Ishay Haviv
- SODA
- 2012

In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n bit word to n receivers (one bit per receiver), where the receivers have side information… (More)

It was recently found that there are very close connections between the existence of additive spanners (subgraphs where all distances are preserved up to an additive stretch), distance preservers… (More)