( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Quadratic Programming with a Ratio Objective.

, , , и . ICALP (1), том 7391 из Lecture Notes in Computer Science, стр. 109-120. Springer, (2012)

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.

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

Другие публикации лиц с тем же именем

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