4 papers
Parameterized Approximation of Max k-Weight CSP: A Dichotomy for Boolean Languages
Rudranarayan Kar, Souvik Saha, Abhishek Sahu
We study \textsc{Max -Weight CSP}: maximize the satisfied weight of Boolean constraints with nonnegative rational weights by setting at most variables to . Each constrain…
Fixed Budget vs. Covering Target: The Partial Set Cover Boundary for Bounded VC-Dimension
Madhumita Kundu, Souvik Saha, Saket Saurabh +1
Maximum Coverage and Partial Set Cover are fundamental parameterized covering problems. The former fixes a budget and maximizes coverage; the latter meets a target with as few…
Line Cover and Related Problems
Matthias Bentert, Fedor v. Fomin, Petr A. Golovach +4
We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of points in the plane can be covered using lines. Line Cover is known to be NP-hard,…
More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
Sushmita Gupta, Pallavi Jain, Souvik Saha +2
Multiwinner Elections have emerged as a prominent area of research with numerous practical applications. We contribute to this area by designing parameterized approximation algorit…