Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks (Q685660)
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: Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks |
scientific article; zbMATH DE number 423567
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks |
scientific article; zbMATH DE number 423567 |
Statements
Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks (English)
0 references
24 October 1993
0 references
approximate algorithms
0 references
\(k\)-partition problem
0 references
0.9065862
0 references
0.8878932
0 references
0.88008213
0 references
0.87615216
0 references
0 references
0.8735168
0 references
