A 3/2-approximation algorithm for \(k_i\)-partitioning (Q408403)
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: A 3/2-approximation algorithm for k_i-partitioning |
scientific article; zbMATH DE number 6022232
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 3/2-approximation algorithm for \(k_i\)-partitioning |
scientific article; zbMATH DE number 6022232 |
Statements
A 3/2-approximation algorithm for \(k_i\)-partitioning (English)
0 references
5 April 2012
0 references
scheduling
0 references
parallel machines
0 references
partition problem
0 references
worst-case analysis
0 references
0.8530861139297485
0 references
0.8510975241661072
0 references
0.8146639466285706
0 references
0.8108274936676025
0 references
0.7991305589675903
0 references
