✦ LIBER ✦

Scaling hypothesis for the Euclidean bipartite matching problem

✍ Scribed by Caracciolo, S.; Lucibello, C.; Parisi, G.; Sicuro, G.

Book ID: 125855245
Publisher: The American Physical Society
Year: 2014
Tongue: English
Weight: 308 KB
Volume: 90
Category: Article
ISSN: 1063-651X
DOI: 10.1103/PhysRevE.90.012118

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The uniquely solvable bipartite matching

The uniquely solvable bipartite matching problem

✍ Katarína Cechlárová 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 249 KB

An efficient algorithm for the bipartite

An efficient algorithm for the bipartite matching problem

✍ Paolo Carraresi; Claudio Sodini 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 612 KB

Worst case bounds for the Euclidean matc

Worst case bounds for the Euclidean matching problem

✍ David Avis 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 424 KB

An extension of the bipartite weighted m

An extension of the bipartite weighted matching problem

✍ Ai-Jia Hsieh; Chin-Wen Ho; Kuo-Chin Fan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Almost Sure Convergence of the Minimum B

Almost Sure Convergence of the Minimum Bipartite Matching Functional in Euclidean Space

✍ J.H. Boutet de Monvel; O.C. Martin 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 149 KB

Approximation algorithms for the Euclide

Approximation algorithms for the Euclidean bipartite TSP

✍ Andreas Baltz; Anand Srivastav 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 214 KB

We study approximation results for the Euclidean bipartite traveling salesman problem (TSP). We present the first worstcase examples, proving that the approximation guarantees of two known polynomial-time algorithms are tight. Moreover, we propose a new algorithm which displays a superior average ca