arXiv (All)
open access
Tight Approximation Results for Matroid Optimization with a Linear Constraint
We study the following class of matroid optimization problems with a linear constraint (P-MOL). Given a matroid M=(E,I), two weight functions $v,w:E\to R_{\ge 0}$, and a threshold $L\in R_{\ge 0}$, find $opt v(S)$ where S is either an independent set or a base of M satisfying a budget-type constrain
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
- Degree Power Sums in Extremal Set Systems#1118672
- A Near-Optimal Linear Range for the Erdős Matching Conjecture#985218
- Pointwise boundary observation in geometric optimization problems associated to variational inequalities#630405
- A deterministic $(2 + \varepsilon)$-approximation for directed feedback vertex sets in tournaments#1122732
- A dual-active-set algorithm for positive semi-definite quadratic programming#429998
Record · ID 1076364
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