arXiv (OAI Expanded)
open access
High-Multiplicity Bin Packing is FPT
Bin packing asks whether a collection of items can be packed into at most a given number of bins of a given capacity. We consider the high-multiplicity setting with $d$ distinct item sizes, in which both the item sizes and the number of items of each size are encoded in binary. Goemans and Rothvos (
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 online bin-packing problem with an underlying ternary structure#316788
- An In-depth Study of LLM Contributions to the Bin Packing Problem#288183
- Exact and Matheuristic Methods for the Generalized Multiple Strip Packing Problem#1013541
- Improved Approximation Algorithms for Three-Dimensional Bin Packing#665481
- Improved Approximation Algorithms for Three-Dimensional Bin Packing#663981
Record · ID 1123335
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