 | 2011 |
|---|
| 10 |       | Amit Kumar,
Rajsekar Manokaran,
Madhur Tulsiani,
Nisheeth K. Vishnoi:
On LP-Based Approximability for Strict CSPs.
SODA 2011: 1560-1573 |
| 9 | | Aditya Bhaskara,
Moses Charikar,
Rajsekar Manokaran,
Aravindan Vijayaraghavan:
On Quadratic Programming with a Ratio Objective
CoRR abs/1101.1710: (2011) |
| 8 | | Venkatesan Guruswami,
Johan Håstad,
Rajsekar Manokaran,
Prasad Raghavendra,
Moses Charikar:
Beating the Random Ordering is Hard: Every ordering CSP is approximation resistant.
Electronic Colloquium on Computational Complexity (ECCC) 18: 27 (2011) |
| 7 | | Venkatesan Guruswami,
Johan Håstad,
Rajsekar Manokaran,
Prasad Raghavendra,
Moses Charikar:
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant.
SIAM J. Comput. 40(3): 878-914 (2011) |
| 2010 |
|---|
| 6 | | Konstantin Makarychev,
Rajsekar Manokaran,
Maxim Sviridenko:
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm.
ICALP (1) 2010: 594-604 |
| 2009 |
|---|
| 5 | | Moses Charikar,
Venkatesan Guruswami,
Rajsekar Manokaran:
Every Permutation CSP of arity 3 is Approximation Resistant.
IEEE Conference on Computational Complexity 2009: 62-73 |
| 4 | | Amit Kumar,
Rajsekar Manokaran,
Madhur Tulsiani,
Nisheeth K. Vishnoi:
On the Optimality of a Class of LP-based Algorithms
CoRR abs/0912.1776: (2009) |
| 3 | | Amit Kumar,
Rajsekar Manokaran,
Madhur Tulsiani,
Nisheeth K. Vishnoi:
On the Optimality of a Class of LP-based Algorithms.
Electronic Colloquium on Computational Complexity (ECCC) 16: 124 (2009) |
| 2008 |
|---|
| 2 | | Venkatesan Guruswami,
Rajsekar Manokaran,
Prasad Raghavendra:
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph.
FOCS 2008: 573-582 |
| 1 | | Rajsekar Manokaran,
Joseph Naor,
Prasad Raghavendra,
Roy Schwartz:
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling.
STOC 2008: 11-20 |
Data released under the ODC-BY 1.0 license — See also our legal information page