Date Added: Oct 2011
Applications of network optimization algorithms can be found in computer networks where routers must be able to find optimal routes over an often vast and dynamic network topology. Obviously it is paramount that these computations be executed as quickly as possible or else network performance will be suboptimal. To implement these practical concerns, it follows that an asymptotic improvement in the time complexity of a network optimization algorithm would be outstanding. This paper introduces a powerful data structure in network optimization - Fibonacci Heaps. It should also present the usage of Fibonacci Heaps for a faster implementation of Dijkstra's for algorithm network optimization .