Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint (Q933069)
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: Lower bounds and modified LPT algorithm for k-partitioning problems with partition matroid constraint |
scientific article; zbMATH DE number 5307753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint |
scientific article; zbMATH DE number 5307753 |
Statements
Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint (English)
0 references
6 August 2008
0 references
partitioning
0 references
constrained partition
0 references
lower bound
0 references
worst case ratio
0 references
0.9132888317108154
0 references
0.8823828101158142
0 references
0.852750837802887
0 references
0.8184994459152222
0 references
0.8082666397094727
0 references
