Sciweavers

13 search results - page 1 / 3
» The Weight and Hopcount of the Shortest Path in the Complete...
Sort
View
CPC
2006
69views more  CPC 2006»
13 years 4 months ago
Size and Weight of Shortest Path Trees with Exponential Link Weights
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
Remco van der Hofstad, Gerard Hooghiemstra, Piet V...
RSA
2010
118views more  RSA 2010»
13 years 3 months ago
Weight of a link in a shortest path tree and the Dedekind Eta function
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
Piet Van Mieghem
CPC
2010
122views more  CPC 2010»
13 years 4 months ago
The Longest Minimum-Weight Path in a Complete Graph
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variable...
Louigi Addario-Berry, Nicolas Broutin, Gábo...
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
13 years 11 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...