1 citations · 1 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman +1
We present an algorithm for a class of -fold ILPs whose existing algorithms in literature are often either (1) based on the \textit{augmentation framework} where one starts with…
cs.DS2024
Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments
Sushmita Gupta, Sounak Modak, Saket Saurabh +1
A feedback vertex set (FVS) in a digraph is a subset of vertices whose removal makes the digraph acyclic. In other words, it hits all cycles in the digraph. Lokshtanov et al. [TALG…