An Experimental Study on Approximating K Shortest Simple Paths

DOI10.1007/978-3-642-23719-5_37zbMATH Open1348.05202OpenAlexW146197455MaRDI QIDQ3092249

Asaf Frieder, Liam Roditty

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_37

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (4)

Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem ⋮ Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems ⋮ Finding the k shortest simple paths ⋮ An efficient implementation of an algorithm for findingK shortest simple paths

This page was built for publication: An Experimental Study on Approximating K Shortest Simple Paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092249)