8 citations · 16 across the 5 of their papers we have counts for
7 papers
Farmer.Chat: Scaling AI-Powered Agricultural Services for Smallholder Farmers
Namita Singh, Jacqueline Wang'ombe, Nereah Okanga +9
Small and medium-sized agricultural holders face challenges like limited access to localized, timely information, impacting productivity and sustainability. Traditional extension s…
Towards a Characterization of Constant-Factor Approximable Finite-Valued CSPs
Victor Dalmau, Andrei Krokhin, Rajsekar Manokaran
In this paper we study the approximability of (Finite-)Valued Constraint Satisfaction Problems (VCSPs) with a fixed finite constraint language Γ consisting of finitary functions on…
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm
Konstantin Makarychev, Rajsekar Manokaran, Maxim Sviridenko
We show that for every positive , unless NP BPQP, it is impossible to approximate the maximum quadratic assignment problem within a factor better than $2^{\log^{1-ε…
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
Per Austrin, Rajsekar Manokaran, Cenny Wenner
We show improved NP-hardness of approximating Ordering Constraint Satisfaction Problems (OCSPs). For the two most well-studied OCSPs, Maximum Acyclic Subgraph and Maximum Betweenne…
Testing Permanent Oracles -- Revisited
Sanjeev Arora, Arnab Bhattacharyya, Rajsekar Manokaran +1
Suppose we are given an oracle that claims to approximate the permanent for most matrices X, where X is chosen from the Gaussian ensemble (the matrix entries are i.i.d. univariate…
On Quadratic Programming with a Ratio Objective
Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran +1
Quadratic Programming (QP) is the well-studied problem of maximizing over {-1,1} values the quadratic form \sum_{i \ne j} a_{ij} x_i x_j. QP captures many known combinatorial optim…
On the Optimality of a Class of LP-based Algorithms
Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani +1
In this paper we will be concerned with a class of packing and covering problems which includes Vertex Cover and Independent Set. Typically, one can write an LP relaxation and then…