✦ LIBER ✦

Minimum—weight perfect matching for nonintrinsic distances on the line

✍ Scribed by J. Delon; J. Salomon; A. Sobolevski

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear-time approximation algorithms for

✍ Masao Iri; Kazuo Murota; Shouichi Matsui 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 574 KB

On the Intersection Number of Matchings

✍ Criel Merino; Gelasio Salazar; Jorge Urrutia 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 319 KB

On the inverse problem of linear program

✍ Siming Huang; Zhenhong Liu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 107 KB

A fast heuristic based on spacefilling c

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

A randomized algorithm for the on-line w

✍ Béla Csaba; András Pluhár 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 283 KB

Average performance of a greedy algorith

✍ Ying The Tsai; Chuan Yi Tang; Yunn Yen Chen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 469 KB