Rajsekar Manokaran
Loading Google Thumbnails...
| 2011 |
|---|
| 7 | On Quadratic Programming with a Ratio Objective. Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran, Aravindan Vijayaraghavan. CoRR (abs/1101.1710) (2011). Web SearchBibTeXDownload |
| 6 | Beating the Random Ordering is Hard: Every ordering CSP is approximation resistant. Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar. Electronic Colloquium on Computational Complexity (ECCC) (18): 27 (2011). Web SearchBibTeXDownload |
| 5 | Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant. Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar. SIAM J. Comput. (40): 878-914 (2011). Web SearchBibTeXDownload |
| 4 | On LP-Based Approximability for Strict CSPs. Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi. SODA 2011, 1560-1573. Web SearchBibTeXDownload |
| 2010 |
|---|
| 3 | Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm. Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko. ICALP (1) 2010, 594-604. Web SearchBibTeXDownload |
| 2009 |
|---|
| 2 | On the Optimality of a Class of LP-based Algorithms. Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi. CoRR (abs/0912.1776) (2009). Web SearchBibTeXDownload |
| 1 | Every Permutation CSP of arity 3 is Approximation Resistant. Moses Charikar, Venkatesan Guruswami, Rajsekar Manokaran. IEEE Conference on Computational Complexity 2009, 62-73. Web SearchBibTeXDownload |
from DBLP and Google Scholar
