Search the dblp DataBase

Publications of Author

1. 
   Every Permutation CSP of arity 3 is Approximation Resistant. [Citation Graph (, )][DBLP]
   
   
2. 
   Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. [Citation Graph (, )][DBLP]
   
   
3. 
   Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm. [Citation Graph (, )][DBLP]
   
   
4. 
   Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. [Citation Graph (, )][DBLP]
   
   
5. 
   On the Optimality of a Class of LP-based Algorithms [Citation Graph (, )][DBLP]