arXiv (All)
open access
An Analytic 0.48-Approximation for Non-Monotone k-Submodular Maximization under a Matroid Constraint
We give a randomized polynomial-time $0.48$-approximation for maximizing a nonnegative non-monotone $k$-submodular function under a matroid constraint, for every $k\ge2$. The algorithm combines a top-two label rule with a nested-chain potential and maximum-weight matroid bases. Its analysis reduces
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Stronger Hardness for Submodular Maximization Subject to a Matroid Constraint#1216762
- On Maximizing a Weakly Submodular Function over a Matroid Constraint via the Greedy Algorithm#971967
- Geometry-Dependent Approximation for Non-Monotone $k$-Submodular Maximization#1199323
- Submodular Welfare under Routing Coupling: A Hierarchical Decomposition with Perturbation Guarantees#984665
- Measurable Matroids: Foundations and Min--Max Theorems#625056
Record · ID 1355074
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive