A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) (Q2084601)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) |
scientific article; zbMATH DE number 7603263
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) |
scientific article; zbMATH DE number 7603263 |
Statements
A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) (English)
0 references
18 October 2022
0 references
scheduling with transportation
0 references
bin packing
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0 references
