Approximation algorithms for the integrated path and bin packing problem
In this paper, we consider the integrated path and bin packing problem, which to use the minimum number of unit-size bins to packing the arcs on the path between two specific vertices in a given directed graph. We propose a 3/2-approximation algorithm and an asymptotic polynomial time approximation scheme.
Authors
- Weidong Li (ORCID: https://orcid.org/0000-0003-3094-4347)
- Ruiqing Sun (ORCID: https://orcid.org/0000-0002-0306-8268)
Publication Details
- Journal
- RAIRO. Operations research
- Published
- 2024-12-31
- DOI
- https://doi.org/10.1051/ro/2024232
- Citations
- 2
- Primary Topic
- Optimization and Packing Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.70
Funders
- National Natural Science Foundation of China