#### Filter Results:

- Full text PDF available (39)

#### Publication Year

1989

2017

- This year (10)
- Last 5 years (32)
- Last 10 years (71)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Prasad Raghavendra
- STOC
- 2008

Semidefinite Programming(SDP) is one of the strongest algorithmic techniques used in the design of approximation algorithms. In recent years, Unique Games Conjecture(UGC) has proved to be intimatelyâ€¦ (More)

- Prasad Raghavendra, David Steurer
- STOC
- 2010

The edge expansion of a subset of vertices S ⊆ V in a graph G measures the fraction of edges that leave S. In a d-regular graph, the edge expansion/conductance Φ(S) of a subset S ⊆ Vâ€¦ (More)

- Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer
- 2013 IEEE 54th Annual Symposium on Foundations ofâ€¦
- 2013

We prove super-polynomial lower bounds on the size of linear programming relaxations for approximation versions of constraint satisfaction problems. We show that for these problems, polynomial-sizedâ€¦ (More)

- Prasad Raghavendra, Ning Tan
- SODA
- 2012

This work is concerned with approximating constraint satisfaction problems (CSPs) with an additional global cardinality constraints. For example, Max Cut is a boolean CSP where the input is a graph Gâ€¦ (More)

- Prasad Raghavendra, David Steurer, Madhur Tulsiani
- 2012 IEEE 27th Conference on Computationalâ€¦
- 2010

The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in graphs. This hardnessâ€¦ (More)

- Prasad Raghavendra, David Steurer
- 2009 50th Annual IEEE Symposium on Foundations ofâ€¦
- 2009

A large number of interesting combinatorial optimization problems like MAX CUT, MAX k-SAT, and UNIQUE GAMES fall under the class of constraint satisfaction problems (CSPs). Recent work by one of theâ€¦ (More)

- Prasad Raghavendra, David Steurer
- 2009 50th Annual IEEE Symposium on Foundations ofâ€¦
- 2009

With the work of Khot and Vishnoi (FOCS 2005) as a starting point, we obtain integrality gaps for certain strong SDP relaxations of unique games. Specifically, we exhibit a gap instance for the basicâ€¦ (More)

- Venkatesan Guruswami, Prasad Raghavendra
- 2006 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

Learning an unknown halfspace (also called a perceptron) from, labeled examples is one of the classic problems in machine learning. In the noise-free case, when a half-space consistent with all theâ€¦ (More)

- Venkatesan Guruswami, Johan HÃ¥stad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar
- SIAM J. Comput.
- 2011

We prove that, assuming the Unique Games Conjecture (UGC), every problem in the class of ordering constraint satisfaction problems (OCSP) where each constraint has constant arity is approximationâ€¦ (More)

- Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra
- 2008 49th Annual IEEE Symposium on Foundations ofâ€¦
- 2008

We prove that approximating the max. acyclic subgraph problem within a factor better than 1/2 is unique games hard. Specifically, for every constant epsiv > 0 the following holds: given a directedâ€¦ (More)