Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
NP-complete problem |
| gptkbp:application |
resource allocation
clustering load balancing |
| gptkbp:complexity |
NP-complete
|
| gptkbp:describes |
The K-partition Problem asks whether a multiset of numbers can be partitioned into K subsets with equal sum.
|
| gptkbp:field |
combinatorial optimization
computer science |
| gptkbp:generalizes |
partition problem
|
| gptkbp:hardness |
strongly NP-complete for K ≥ 3
|
| https://www.w3.org/2000/01/rdf-schema#label |
K-partition Problem
|
| gptkbp:input |
integer K
multiset of numbers |
| gptkbp:output |
yes/no answer
|
| gptkbp:relatedTo |
set partitioning
partition problem |
| gptkbp:solvedBy |
backtracking
approximation algorithms dynamic programming (for small K) |
| gptkbp:studiedBy |
1970s
|
| gptkbp:bfsParent |
gptkb:Partition_Problem
|
| gptkbp:bfsLayer |
7
|