Tighter bounds on a heuristic for a partition problem (Q1350239)
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: Tighter bounds on a heuristic for a partition problem |
scientific article; zbMATH DE number 983948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tighter bounds on a heuristic for a partition problem |
scientific article; zbMATH DE number 983948 |
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
0.8559233546257019
0 references
0.8341796398162842
0 references
0.8291892409324646
0 references
