Metraipolis › archive › dc_e4a2de4ea076

Submodular Maximization over Bipartite Perfect Matchings and Matroid Intersection Bases — arXiv:2609.21696

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.21696
License (as archived)
CC0-1.0
Archived
2026-10-10T02:46:03.852Z
SHA-256 of the archived text
7eacaf434dd14638e8b448aace50e91e10dddba67b672f100d57a25508113f50
Stable URL of this page
https://metraipolis.com/documento/dc_e4a2de4ea076

How to cite

Submodular Maximization over Bipartite Perfect Matchings and Matroid Intersection Bases — arXiv:2609.21696 — arXiv (en), https://arxiv.org/abs/2609.21696 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e4a2de4ea076 (Metraipolis archive dc_e4a2de4ea076, sha256 7eacaf434dd14638e8b448aace50e91e10dddba67b672f100d57a25508113f50)
BibTeX
@misc{dce4a2de4ea076,
  title = {Submodular Maximization over Bipartite Perfect Matchings and Matroid Intersection Bases — arXiv:2609.21696},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.21696},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e4a2de4ea076; sha256 7eacaf434dd14638e8b448aace50e91e10dddba67b672f100d57a25508113f50},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21696. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Motivated by applications in fairness and foundational questions, we consider the problem of maximizing a monotone submodular function $f\colon 2^E \rightarrow \mathbb{R}_+$ over maximum cardinality sets in the intersection of two matroids on a common ground set $E$. An important special case is submodular perfect matching in bipartite graphs. Prior to this work, its approximability was poorly understood with only constant inapproximability known, despite not even a $\frac{1}{o(\sqrt{|E|})}$-approximation being known. Even when allowing to violate the cardinality constraint slightly, only a bicriteria approximation with a significant loss in the objective was known. Here, we obtain two results. First, we show that, within constant factors, the problem is approximation-equivalent to Submodular Orienteering in directed graphs. This yields an $\Omega(1 / \log |E|)$-approximation in quasi-polynomial time together with an almost-matching hardness result. Second, we obtain an improved polynomial-time bicriteria approximation via a local search framework. More precisely, if $f(T^*)$ is the largest submodular value of a common independent set in both matroids of size at least $K$, we find a common independent set $T$ such that $|T| \geq (1 - \epsilon) K$ and $f(T) \geq (1/2 - \epsilon) f(T^*)$. In contrast, previous work only guarantees a value of $\Omega(\epsilon) f(T^*)$ while ensuring that $|T| \geq (1 - \epsilon) K$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.21696 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T02:29:43.007Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).