Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:architecture
|
| gptkbp:allows |
corrupted keys
|
| gptkbp:application |
Kruskal's algorithm optimization
selection in linear time |
| gptkbp:complexity |
O(1) amortized insert
O(log(1/ε)) amortized delete-min |
| gptkbp:describedBy |
Bernard Chazelle, 'The Soft Heap: An Approximate Priority Queue with Optimal Error Rate', JACM 2000
|
| https://www.w3.org/2000/01/rdf-schema#label |
Soft Heap
|
| gptkbp:introducedIn |
2000
|
| gptkbp:inventedBy |
gptkb:Bernard_Chazelle
|
| gptkbp:operator |
insert
delete-min meld |
| gptkbp:parameter |
error rate (ε)
|
| gptkbp:property |
some keys may be increased arbitrarily
guarantees at most εn corrupted keys after n operations |
| gptkbp:relatedTo |
heap
priority queue |
| gptkbp:usedIn |
approximate selection algorithms
minimum spanning tree algorithms |
| gptkbp:bfsParent |
gptkb:Pip_Pyle
|
| gptkbp:bfsLayer |
7
|