arXiv (All)
open access
Breaking the $\sqrt{3}$ Barrier for Maximum Weighted $3$-Set Packing
We give a deterministic polynomial-time $1.6908$-approximation for Maximum Weighted $3$-Set Packing, breaking the $\sqrt3$ locality-gap barrier of squared-weight local search. The approximation ratio for this problem progressed from Berman's $2$ [Ber00] to Neuwohner's $2-\frac{1}{63{,}700{,}992}+ε$
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
- Fully tolerant product state testing and closest product state learning#1157327
- Solution of uniform Turán's Tetrahedron Problem#999313
- Hardness of Learning with Physical Rounding and Noise from Learning With Errors#445657
- Fractional list packing for layered graphs#131249
- GPU-Accelerated Bregman Douglas-Rachford Splitting for Discrete Optimal Transport#1200366
Record · ID 1234403
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