Two-phase algorithms for the parametric shortest path problem
From MaRDI portal
Publication:3113746
DOI10.4230/LIPIcs.STACS.2010.2452zbMath1230.68228MaRDI QIDQ3113746
Eldar Fischer, Oded Lachish, Sourav Chakraborty, Raphael Yuster
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_53cb.html
68W40: Analysis of algorithms
05C38: Paths and cycles
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)
05C22: Signed and weighted graphs
Related Items
A stronger lower bound on parametric minimum spanning trees, Possibilistic bottleneck combinatorial optimization problems with ill-known weights, A stronger lower bound on parametric minimum spanning trees, An algorithm for single-source shortest paths enumeration in parameterized weighted graphs
Uses Software