Author of the publication

On Quadratic Programming with a Ratio Objective

, , , and . Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I, page 109--120. (2012)
DOI: 10.1007/978-3-642-31594-7_10

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Manokaran, Rajsekar
add a person with the name Manokaran, Rajsekar
 

Other publications of authors with the same name

Towards a Characterization of Constant-Factor Approximable Min CSPs., , and . SODA, page 847-857. SIAM, (2015)Improved NP-Inapproximability for 2-Variable Linear Equations., , , , and . Theory of Computing, 13 (1): 1-51 (2017)On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems., , and . Theory of Computing, (2015)Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm., , and . ACM Trans. Algorithms, 10 (4): 18:1-18:18 (2014)On the Hardness of Approximating Balanced Homogenous 3-Lin., and . Theory of Computing, 13 (1): 1-19 (2017)Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm., , and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 594-604. Springer, (2010)Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling., , , and . STOC, page 11-20. ACM, (2008)Improved NP-Inapproximability for 2-Variable Linear Equations., , , , and . APPROX-RANDOM, volume 40 of LIPIcs, page 341-360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Towards a characterization of constant-factor approximable finite-valued CSPs., , and . J. Comput. Syst. Sci., (2018)On Quadratic Programming with a Ratio Objective., , , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 109-120. Springer, (2012)