In this paper, we prove sharp estimates for the average cost of the optimal matching problem on the flat 2-torus, using quantitative linearization and the method of trajectories.

KI fragen

Bookmark

View Full Paper

KI fragen

Bookmark

View Full Paper

Cite This Study

Ariel Lerman (Thu,) studied this question.

synapsesocial.com/papers/68e64050b6db6435875d21a3 https://doi.org/https://doi.org/10.48550/arxiv.2406.14471

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Sharp PDE estimates for random two-dimensional bipartite matching with power cost function2024
2Mean field stable matchings2024
3An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching2024
4Random Matching in 2D with Exponent 2 for Gaussian Densities2024 · 3 citations
5Approximating Maximum Matching Requires Almost Quadratic Time2024 · 2 citations

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Sharp PDE estimates for random two-dimensional bipartite matching with power cost function2024
2Mean field stable matchings2024
3An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching2024
4Random Matching in 2D with Exponent 2 for Gaussian Densities2024 · 3 citations
5Approximating Maximum Matching Requires Almost Quadratic Time2024 · 2 citations