Three-partitioning containing kernels: Complexity and heuristic (Q1924322)
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: Publication:1924322 |
scientific article; zbMATH DE number 935216
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three-partitioning containing kernels: Complexity and heuristic |
scientific article; zbMATH DE number 935216 |
Statements
Three-partitioning containing kernels: Complexity and heuristic (English)
0 references
23 February 1997
0 references
\(k\)-partitioning containing kernels
0 references
NP-complete
0 references
heuristic
0 references
LPT-algorithm
0 references
worst case bound
0 references
0.8581579923629761
0 references
0.8316842913627625
0 references
0.8306602239608765
0 references
0.8230803608894348
0 references
