Tight lower bounds for weighted matroid problems
I Doron-Arad, A Kulik, H Shachnai - arXiv preprint arXiv:2307.07773, 2023 - arxiv.org
In this paper we derive tight lower bounds resolving the hardness status of several
fundamental weighted matroid problems. One notable example is budgeted matroid …
fundamental weighted matroid problems. One notable example is budgeted matroid …
Lower bounds for matroid optimization problems with a linear constraint
I Doron-Arad, A Kulik, H Shachnai - 51st International Colloquium …, 2024 - drops.dagstuhl.de
We study a family of matroid optimization problems with a linear constraint (MOL). In these
problems, we seek a subset of elements which optimizes (ie, maximizes or minimizes) a …
problems, we seek a subset of elements which optimizes (ie, maximizes or minimizes) a …
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems
We consider the problem of finding a basis of a matroid with weight exactly equal to a given
target. Here weights can be discrete values from $\{-\Delta,\ldots,\Delta\} $ or more generally …
target. Here weights can be discrete values from $\{-\Delta,\ldots,\Delta\} $ or more generally …
Unsplittable Flow on a Short Path
In the Unsplittable Flow on a Path problem UFP, we are given a path graph with edge
capacities and a collection of tasks. Each task is characterized by a demand, a profit, and a …
capacities and a collection of tasks. Each task is characterized by a demand, a profit, and a …
Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
In this paper we introduce Sampling with a Black Box, a generic technique for the design of
parameterized approximation algorithms for vertex deletion problems (eg, Vertex Cover …
parameterized approximation algorithms for vertex deletion problems (eg, Vertex Cover …