Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:approach |
greedy
|
| gptkbp:complexity |
O(n log n)
|
| gptkbp:field |
computer science
theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Karmarkar–Karp algorithm
|
| gptkbp:input |
multiset of numbers
|
| gptkbp:introducedIn |
1982
|
| gptkbp:namedAfter |
gptkb:Richard_M._Karp
gptkb:Narendra_Karmarkar |
| gptkbp:output |
partition with minimized difference
|
| gptkbp:publishedIn |
gptkb:Operations_Research_Letters
|
| gptkbp:relatedTo |
NP-complete problems
subset sum problem |
| gptkbp:solvedBy |
number partitioning problem
|
| gptkbp:type |
gptkb:algorithm
|
| gptkbp:bfsParent |
gptkb:Zohar_Kaufman
|
| gptkbp:bfsLayer |
7
|