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 the normal view instead:
scientific article; zbMATH DE number 7603263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.8697975277900696
0 references
0.862386167049408
0 references
0.848296582698822
0 references
0.8453904986381531
0 references
