94 citations · 448 across the 40 of their papers we have counts for
1 paper · 1 filter
Matteo D'Achille, Francesco Mattesini, Dario Trevisan
We prove concentration bounds for random Euclidean combinatorial optimization problems with p--costs. For bipartite matching and for the (mono- and bi-partite) traveling salesper…