2 citations · 3 across the 2 of their papers we have counts for
2 papers
math.PR2014★ 2 cited
Explosion and linear transit times in infinite trees
Omid Amini, Luc Devroye, Simon Griffiths +1
Let be an infinite rooted tree with weights assigned to its edges. Denote by the minimum weight of a path from the root to a node of the th generation. We con…
cs.DS2014★ 1 cited
A note on hierarchical hubbing for a generalization of the VPN problem
Neil Olver
Robust network design refers to a class of optimization problems that occur when designing networks to efficiently handle variable demands. The notion of "hierarchical hubbing" was…