The approximability of three-dimensional assignment problems with bottleneck objective (Q845547)
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: The approximability of three-dimensional assignment problems with bottleneck objective |
scientific article; zbMATH DE number 5664368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The approximability of three-dimensional assignment problems with bottleneck objective |
scientific article; zbMATH DE number 5664368 |
Statements
The approximability of three-dimensional assignment problems with bottleneck objective (English)
0 references
29 January 2010
0 references
bottleneck problem
0 references
multidimensional assignment
0 references
approximation
0 references
computational complexity
0 references
efficient algorithm
0 references
0 references
0 references
0 references
0.8377453684806824
0 references
0.8362335562705994
0 references
0.8358640670776367
0 references
0.8032647967338562
0 references
0.8012102246284485
0 references
