We provide an algorithm for this problem which improves general matroid intersection algorithms by exploiting the simple structure of the side constraints.
Franz Rendl, Matthias Leclerc: A multiply constrained matroid optimization problem. Discret. Math. 73(1-2): 207-212 (1989). manage site settings.
It is shown that the solution to the constrained problem must occur at constraint boundaries, allowing earlier algorithms for a simpler version of the problem ...
Abstract. We study a family of matroid optimization problems with a linear constraint (MOL). In these problems, we seek a subset of elements which optimizes ...
Jun 28, 2011 · The idea is that many natural problems exhibit some matroidal structure, a common structure which algorithms can exploit. In other words, many ...
Missing: multiply | Show results with:multiply
Apr 20, 2024 · We study a family of matroid optimization problems with a linear constraint (MOL). In these problems, we seek a subset of elements which ...
For the problem of maximizing a submodular function subject to a matroid constraint (special case of p = 1), the greedy algorithm achieves a ratio of 1/2. When ...
Jul 15, 2023 · 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, ...
Aug 21, 2024 · They leverage the structure of matroids to guarantee optimal solutions for a wide range of problems, from spanning trees to job scheduling.
We look at the problem of maximizing a set function f with lower and upper submodularity ratio γ and β under a matroid constraint.