Sergio Caracciolo

most citedRandom assignment problems on

2 d

manifolds

8 citations · 8 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2026

Spanning trees in the Assignment Problem: two theorems and two conjectures

Sergio Caracciolo, Gabriele Sicuro, Andrea Sportiello

The \emph{Minimum Matching Problem} consists of finding an independent edge set of minimum weight $M_{⋆} (G)$ in a given edge-weighted graph $G$ . When $G$ is bipartite, this red…

math-ph2020★ 8 cited

Random assignment problems on $2 d$ manifolds

Dario Benedetto, Emanuele Caglioti, Sergio Caracciolo +3

We consider the assignment problem between two sets of $N$ random points on a smooth, two-dimensional manifold $Ω$ of unit area. It is known that the average cost scales as $E_Ω(N)…

Spanning trees in the Assignment Problem: two theorems and two conjectures

Random assignment problems on 2d manifolds

Random assignment problems on $2 d$ manifolds