41 citations · 60 across the 12 of their papers we have counts for
Showing 2007 · math.PRShow all
3 papers · 2 filters
math.PR2007
Dynamic Programming Optimization over Random Data: the Scaling Exponent for Near-optimal Solutions
David J. Aldous, Charles Bordenave, Marc Lelarge
A very simple example of an algorithmic problem solvable by dynamic programming is to maximize, over sets A in {1,2,...,n}, the objective function |A| - \sum_i ξ_i 1(i \in A,i+1 \i…
math.PR2007★ 1 cited
Edge Flows in the Complete Random-Lengths Network
David J. Aldous, Shankar Bhamidi
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow be…
math.PR2007
Short-length routes in low-cost networks via Poisson line patterns
David J. Aldous, Wilfrid S. Kendall
In designing a network to link n cities in a square of area n, one might be guided by the following two desiderata. First, the total network length should not be much greater than…