Tight approximations for resource constrained scheduling and bin packing (Q1372745)
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 1088866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight approximations for resource constrained scheduling and bin packing |
scientific article; zbMATH DE number 1088866 |
Statements
Tight approximations for resource constrained scheduling and bin packing (English)
0 references
7 January 1998
0 references
resource constrained scheduling
0 references
multidimensional bin packing
0 references
randomized algorithm
0 references
derandomization
0 references
approximation algorithm
0 references
chromatic index
0 references
0 references
0 references
0.9248063
0 references
0.9077619
0 references
0.9077619
0 references
0.9075177
0 references
0.9075177
0 references
0.90459144
0 references
0.9030699
0 references
