arXiv (All)
open access
Geometry-Dependent Approximation for Non-Monotone $k$-Submodular Maximization
We study nonnegative, non-monotone $k$-submodular maximization with $k\ge2$ labels under support constraints, and show how the certified approximation coefficient improves as the support region permits more uniform selection. For a compact convex down-closed support region $P\subseteq[0,1]^n$, the d
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
- A Deterministic $0.401$-Approximation for Non-monotone Submodular Maximization under Matroid Constraints#1341669
- An Analytic 0.48-Approximation for Non-Monotone k-Submodular Maximization under a Matroid Constraint#1355074
- A 0.4584-approximation for DR-submodular maximization over down-closed convex sets#1356408
- 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
Record · ID 1199323
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