✦ LIBER ✦

Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours

✍ Scribed by Buss, Samuel R.; Yianilos, Peter N.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm for maximum matc

✍ G. Steiner; J.S. Yeomans 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 563 KB

Linear time algorithms for convex and mo

✍ Vasant A. Ubhaya 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 833 KB

Linear-time approximation algorithms for

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

New polynomial-time cycle-canceling algo

✍ P. T. Sokkalingam; Ravindra K. Ahuja; James B. Orlin 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

Polynomial-Time Algorithms for Linear an

✍ Shioura, Akiyoshi; Tanaka, Ken'ichiro 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 209 KB

Algorithms for minimum-cost paths in tim

✍ Brian C. Dean 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB