Deutsche Nationalbibliothek
metadata only
Tight Approximation Results for Matroid Optimization with a Linear Constraint / Ilan Doron-Arad, Hadas Shachnai, Gilad Shmerler
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
- Minimax solution of statistical decision problems by iteration#1305770
- On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms#635617
- On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms#633268
- Efficient Algorithms for Subdeterminant Maximization under Partition Matroids#1011802
Record · ID 1188609
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