Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
type: Item
instance of: scholarly article
title: Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
zbMATH Open document ID: 1193.68193
author: Zvi Gotthilf
author: Moshe Lewenstein
published in: Information Processing Letters
publication date: 2010-06-16T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5722002
zbMATH Keywords: algorithms
zbMATH Keywords: shortest paths
zbMATH Keywords: replacement paths
zbMATH Keywords: \(k\) simple shortest paths
zbMATH Keywords: weighted directed graphs
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.12.015
OpenAlex ID: W2094099891
cites work: More algorithms for all-pairs shortest paths in weighted graphs
cites work: A note on two problems in connexion with graphs
cites work: Finding the k Shortest Paths
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: An efficient algorithm for K shortest simple paths
cites work: A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
cites work: The k most vital arcs in the shortest path problem
cites work: A new approach to all-pairs shortest paths on real-weighted graphs
cites work: Q2934682
cites work: Automata, Languages and Programming
DOI: 10.1016/J.IPL.2008.12.015
Recommended article: Q5417664
Recommended article: Improved algorithms for replacement paths problems in restricted graphs
Recommended article: Finding the k shortest simple paths
Recommended article: An efficient implementation of an algorithm for findingK shortest simple paths
Recommended article: Automata, Languages and Programming
Recommended article: Replacement paths and k simple shortest paths in unweighted directed graphs
Recommended article: Near-shortest and K-shortest simple paths
Recommended article: A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
Recommended article: An experimental study on approximating \(k\) shortest simple paths
Recommended article: An Experimental Study on Approximating K Shortest Simple Paths
description: scientific article; zbMATH DE number 5722002