Math-1860 · mathematics · Combinatorics

Math-1860

Bounded degree matroid basis

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Let $M$ be a matroid on a finite set $V$, given by an independence oracle: on a queried subset it reports whether that subset is independent. Independent sets are closed under taking subsets and satisfy the exchange axiom; their maximal members are bases. Let $\mathcal H$ be an explicitly listed family of subsets of $V$, and set \[ \Delta=\max_{v\in V}|\{H\in\mathcal H:v\in H\}|\ge1. \] Assign rational costs $c_v$ and integer bounds $\ell_H\le u_H$. Assume at least one basis satisfies every bound, and let $\mathrm{OPT}$ be the least cost of such a basis, with $c(B)=\sum_{v\in B}c_v$.

Is there an algorithm using polynomially many oracle calls and polynomial time in the input encoding that returns a basis $B$ satisfying \[ c(B)\le\mathrm{OPT},\qquad \ell_H-\Delta+1\le |B\cap H|\le u_H+\Delta-1 \quad(H\in\mathcal H)? \] Both lower and upper bounds must be handled simultaneously. The output may violate the original degree constraints, but only by the displayed additive amount; its cost is compared with the optimum under the original constraints. The number $\Delta$ counts constraints involving one ground element, not the largest size of a constraint set. The empty-family case reduces to ordinary minimum-cost basis computation and needs no relaxation.

Short English statement

Can one find a basis costing no more than the constrained optimum while violating every lower and upper degree bound by at most $\Delta-1$?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.