arXiv (All)
open access
Submodular Maximization under Supermodular Constraint: Greedy Guarantees
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
- Submodular Maximization under Supermodular Constraint: Greedy Guarantees#613954
- Feature-weighted maximum representative subsampling.#263160
- Streaming algorithms for robust max-min diversification#1156728
- Optimal impartial correspondences#367001
- Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees#999543
Record · ID 614921
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