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...
Uložené v:
| Vydané v: | R.A.I.R.O. Recherche opérationnelle Ročník 59; číslo 1; s. 325 - 333 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
01.01.2025
|
| ISSN: | 0399-0559, 2804-7303 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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. |
|---|---|
| ISSN: | 0399-0559 2804-7303 |
| DOI: | 10.1051/ro/2024232 |