An experimental study on approximating K Shortest simple paths

We have conducted an extensive experimental study on approximation algorithms for computing k shortest simple paths in weighted directed graphs. Very recently, Bernstein [2] presented an algorithm that computes a 1+ approximated k shortest simple paths in O(^-1 k(m+n log n)log ² n) time. We have implemented Bernstein's algorithm and tested it on synthetic inputs and real world graphs (road maps). Our results reveal that Bernstein's algorithm has a practical value in many scenarios. Moreover, it produces in most of the cases exact paths rather than approximated. We also present a new variant for Bernstein's algorithm. We prove that our new variant has the same upper bounds for the running time and approximation as Bernstein's original algorithm. We have implemented and tested this variant as well. Our testing show that this variant, which is based on a simple theoretical observation, is better than Bernstein's algorithm in practice.