✦ LIBER ✦

Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane

✍ Scribed by Masao Iri; Kazuo Murota; Shouichi Matsui

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum—weight perfect matching for noni

✍ J. Delon; J. Salomon; A. Sobolevski 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 277 KB

An efficient parallel algorithm for find

✍ Xin He 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 821 KB

A linear-time approximation algorithm fo

✍ R Bar-Yehuda; S Even 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 257 KB

A fast heuristic based on spacefilling c

✍ John J. Bartholdi III; Loren K. Platzman 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 507 KB

A linear time algorithm for the maximum

✍ Ming-Shing Yu; Cheng-Hsing Yang 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 497 KB

A linear time algorithm for the weighted

✍ Nir Halman 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 128 KB