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...
Saved in:
| Published in: | R.A.I.R.O. Recherche opérationnelle Vol. 59; no. 1; pp. 325 - 333 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.01.2025
|
| ISSN: | 0399-0559, 2804-7303 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!