Rajsekar Manokaran
- Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
2008/10/01 by Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra · 5 citations
Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Computational Geometry and Mesh Generation #Directed acyclic graph #Combinatorics #Bounded function #Mathematics #Approximation algorithm #Induced subgraph isomorphism problem #Directed graph #Discrete mathematics #Constraint satisfaction problem #Feedback arc set #Domain (mathematical analysis) #Time complexity #Graph #Line graph
- Every Permutation CSP of arity 3 is Approximation Resistant
2009/07/01 by Moses Charikar, Venkatesan Guruswami, Rajsekar Manokaran · 6 citations
Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #Limits and Structures in Graph Theory #Arity #Permutation (music) #Constraint satisfaction problem #Combinatorics #Tuple #Mathematics #Discrete mathematics #Constraint (computer-aided design) #Set (abstract data type) #Lambda #Sigma #Random permutation #Computer science
- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
2013/07/18 by Per Austrin, Rajsekar Manokaran, Austrin, Per +3 · 3 citations
Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #cs.CC
- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm
2014/03/30 by Konstantin Makarychev, Rajsekar Manokaran, Makarychev, Konstantin +3 · 3 citations
Computer Science · #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.CC #cs.DS
- Farmer.Chat: Scaling AI-Powered Agricultural Services for Smallholder Farmers
2024/09/13 by Namita Singh, Singh, Namita, J. Wang’ombe +21 · 4 citations
Business, Management and Accounting · Engineering · #FinTech, Crowdfunding, Digital Finance #Smart Cities and Technologies
- Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
2011/01/01 by Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran +2 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Constraint Satisfaction and Optimization #Limits and Structures in Graph Theory #Arity #Combinatorics #Mathematics #Conjecture #Constant (computer programming) #Constraint satisfaction problem #Approximation algorithm #Fraction (chemistry) #Discrete mathematics #Computer science