Abhishek Sahu

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2024

Parameterized Approximation for Capacitated $d$ -Hitting Set with Hard Capacities

Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh +2

The \textsc{Capacitated $d$ -Hitting Set} problem involves a universe $U$ with a capacity function $cap : U \to N$ and a collection $A$ of subsets…

cs.DS2024

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints

Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov +3

In MaxSAT with Cardinality Constraint problem (CC-MaxSAT), we are given a CNF-formula $Φ$ , and $k \geq 0$ , and the goal is to find an assignment $β$ with at most $k$ variables set t…

cs.DS2023

An Improved Exact Algorithm for Knot-Free Vertex Deletion

Ajaykrishnan E S, Soumen Maity, Abhishek Sahu +1

A knot $K$ in a directed graph $D$ is a strongly connected component of size at least two such that there is no arc $(u, v)$ with $u \in V (K)$ and $v \in / V (K)$ . Given a directed g…

Parameterized Approximation for Capacitated d-Hitting Set with Hard Capacities

Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints

An Improved Exact Algorithm for Knot-Free Vertex Deletion

Parameterized Approximation for Capacitated $d$ -Hitting Set with Hard Capacities