arXiv (All)
open access
Improved Algorithms for Beck--Fiala with Bounded Sets
We give an efficient algorithm with improved algorithmic guarantees for the (offline) Beck--Fiala problem when the sets have bounded size. Let $A$ be an arbitrary matrix $A\in\{0,1\}^{m\times n}$ with at most $d$ ones per column and at most $s$ ones per row. Let $\log^*$ denote the iterated logarith
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
- An Exposition of the $\widetilde{O}(\log^{1/4} n)$ Bound for the Komlós Problem#792456
- An Exposition of the $\widetilde{O}(\log^{1/4} n)$ Bound for the Komlós Problem#788456
- Matrix-Vector Complexity of Low-Rank Approximation#1130682
- Extremal problems for cancellative and locally thin hypergraphs#986484
- Concentration for random Euclidean combinatorial optimization#987596
Record · ID 1014302
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