Rajsekar Manokaran

Available identifiers

zbMath Open manokaran.rajsekarMaRDI QIDQ1671995

List of research outcomes

Publication	Date of Publication	Type
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm	2018-10-30	Paper
Towards a characterization of constant-factor approximable finite-valued CSPs	2018-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q5368897	2017-10-11	Paper
Towards a Characterization of Constant-Factor Approximable Min CSPs	2017-10-05	Paper
https://portal.mardi4nfdi.de/entity/Q5365139	2017-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q2941635	2015-08-21	Paper
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems	2013-10-04	Paper
On Quadratic Programming with a Ratio Objective	2013-08-12	Paper
Testing Permanent Oracles – Revisited	2012-11-02	Paper
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant	2011-10-18	Paper
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm	2010-09-07	Paper

Research outcomes over time

This page was built for person: Rajsekar Manokaran