arXiv (OAI Expanded)
open access
Distributed Santa Claus via Global Rounding
In this paper, we initiate the study of a new class of problems in the CONGEST model: Mixed packing and covering linear programs (LP). Previously, the design of optimization algorithms in the distributed setting was heavily focused on solving linear programs with either packing or covering 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
- Exact and Matheuristic Methods for the Generalized Multiple Strip Packing Problem#1013541
- Tight Energy Lower Bounds for Distributed Graph Algorithms#467099
- An infeasible interior-point algorithm for solving primal and dual geometric programs#429971
- PrecPack: An Efficient Open-Source Exact Solver for Bin Packing with Generalized Precedence Constraints#1123733
- MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem#1156291
Record · ID 1084194
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