Finding the \(k\) quickest simple paths in a network
type: Item
instance of: scholarly article
title: Finding the \(k\) quickest simple paths in a network
zbMATH Open document ID: 0804.90129
DOI: 10.1016/0020-0190(94)00008-5
author: V. Pereyra
published in: Information Processing Letters
publication date: 1994-06-09T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 562524
zbMATH Keywords: combinatorial problems
zbMATH Keywords: design of algorithms
zbMATH Keywords: quickest path problem
zbMATH Keywords: routing path
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00008-5
OpenAlex ID: W2052497422
cites work: An algorithm for finding the \(k\) quickest paths in a network
cites work: The quickest path problem
cites work: Shortest-path algorithms: Taxonomy and annotation
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: An efficient algorithm for K shortest simple paths
cites work: Algorithms for the quickest path problem and the enumeration of quickest paths
cites work: Finding the K Shortest Loopless Paths in a Network
description: scientific article; zbMATH DE number 562524