Encontrado 1 documento, a visualizar página 1 de 1

Computational experiments with a lazy version of a  K  quickest simple path ran...

Abstract The quickest path problem is related to the classical shortest path problem, but its objective function concerns the transmission time of a given amount of data throughout a path, which involves both cost and capacity. The K-quickest simple paths problem generalises the latter, by looking for a given number K of simple paths in non-decreasing order of transmission time. Two categories of algorithm...