3 citations · 4 across the 5 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
math.PR2022
Finding minimum spanning trees via local improvements
Louigi Addario-Berry, Jordan Barrett, Benoît Corsini
We consider a family of local search algorithms for the minimum-weight spanning tree, indexed by a parameter . One step of the local search corresponds to replacing a connected…
math.PR2020
Random tree-weighted graphs
Louigi Addario-Berry, Jordan Barrett
For each , let be a sequence of positive integers with even sum . Let be uniformly dist…