Shortest paths with a cost constraint: A probabilistic analysis

Shortest paths with a cost constraint: A probabilistic analysis

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics 2021-10, Vol.302, p.46-53
Hauptverfasser: Frieze, Alan, Tkocz, Tomasz
Format: Artikel
Sprache:eng
Schlagworte:
Constraints
Cost analysis
Cost constraint
Graphs
Probabilistic analysis
Random shortest path
Weighted graph
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2021.06.001