arXiv (All)
open access
On Maximizing a Weakly Submodular Function over a Matroid Constraint via the Greedy Algorithm
We consider the problem of approximately maximizing a weakly submodular function using the standard greedy algorithm, which is known to give tight approximation results for such functions under a cardinality constraint. We show that this is not the case for general matroid constraints. For any $γ< 1
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 Welfare under Routing Coupling: A Hierarchical Decomposition with Perturbation Guarantees#984665
- The Full P-vertex Problem and Perfect Matchings for Bipartite Graphs#987518
- The Minimum-Weight Mixed Dominating Set on Threshold Graphs#924639
- On the Minimum Possible Maximum Degree of Induced Subgraphs of Product Graphs#1117615
- Spanning subhypergraphs with degree constraints#1109177
Record · ID 971967
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