An experimental study on approximating K Shortest simple paths

Asaf Frieder, Liam Roditty

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


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 2 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.

Original languageEnglish
Title of host publicationAlgorithms, ESA 2011 - 19th Annual European Symposium, Proceedings
Number of pages12
StatePublished - 2011
Event19th Annual European Symposium on Algorithms, ESA 2011 - Saarbrucken, Germany
Duration: 5 Sep 20119 Sep 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6942 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference19th Annual European Symposium on Algorithms, ESA 2011


Dive into the research topics of 'An experimental study on approximating K Shortest simple paths'. Together they form a unique fingerprint.

Cite this