``Fibonacci heaps'' have a good amortized running time for DECREASE-KEY: , O(1), .
Total running time: .
Probably wouldn't really ever want to use this, but it is an asymptotic improvement.