Tighter bounds on a heuristic for a partition problem (Q1350239): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:04, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tighter bounds on a heuristic for a partition problem |
scientific article |
Statements
Tighter bounds on a heuristic for a partition problem (English)
0 references
27 February 1997
0 references
Discrete minimization
0 references
Partition
0 references
Storage allocation
0 references
NP-hard
0 references
Algorithms
0 references
Approximation algorithms
0 references
Worst-case bound
0 references
