2 papers
cs.DS2025
Fully-Dynamic Submodular Cover with Bounded Recourse
Anupam Gupta, Roie Levin
In submodular covering problems, we are given a monotone, nonnegative submodular function and wish to find the min-cost set such tha…
cs.DS2025
Matroid-Based TSP Rounding for Half-Integral Solutions
Anupam Gupta, Euiwoong Lee, Jason Li +3
We show how to round any half-integral solution to the subtour-elimination relaxation for the TSP, while losing a less-than-1.5 factor. Such a rounding algorithm was recently given…