A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics
[chapter]

2018
*
Lecture Notes in Computer Science
*

A graph G = (V, E) satisfies the α, β-cut-property if the fraction of edges present in each cut of the graph lies between α and β. The Erdős-Rényi random graph G(n, p) satisfies this property w.h.p. for α = (1 − ε)p and β = (1 + ε)p whenever p is sufficiently large and ε is a suitably chosen constant. We study the behavior of random shortest path metrics applied to graphs G that satisfy the α, β-cut-property. These random metrics are defined as follows: Let w(e) be independently drawn random

doi:10.1007/978-3-030-10564-8_9
fatcat:7l4boyd2kzdjhpphil3fkfmmme