Shortest paths with a cost constraint: a probabilistic analysis
Combinatorics
2021-11-16 v1
Abstract
We consider a constrained version of the shortest path problem on the complete graphs whose edges have independent random lengths and costs. We establish the asymptotic value of the minimum length as a function of the cost-budget within a wide range.
Cite
@article{arxiv.2005.12241,
title = {Shortest paths with a cost constraint: a probabilistic analysis},
author = {Alan Frieze and Tomasz Tkocz},
journal= {arXiv preprint arXiv:2005.12241},
year = {2021}
}