✦ LIBER ✦

An O(n log n) algorithm for the convex bipartite matching problem

✍ Scribed by G. Gallo

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 197 KB
Volume: 3
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(84)90068-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n log m) algorithm for the Josephus

An O(n log m) algorithm for the Josephus Problem

✍ Errol L Lloyd 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 458 KB

A new O(n·log n) algorithm for computing

A new O(n·log n) algorithm for computing the intersection of convex polygons

✍ Sukhamay Kundu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 441 KB

An O(m log n) algorithm for the max + su

An O(m log n) algorithm for the max + sum spanning tree problem

✍ Abraham P. Punnen; K.P.K. Nair 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 240 KB

An algorithm to solve the m × n assignme

An algorithm to solve the m × n assignment problem in expected time O(mn log n)

✍ Richard M. Karp 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB

## Abstract We give an algorithm to solve the __m__‐source, __n__‐destination assignment problem in expected time __O(mn__ log __n__) under the assumption that the edge costs are independent random variables and the costs of the edges incident with any given source are identically distributed. The

An O(n) algorithm for least squares quas

An O(n) algorithm for least squares quasi-convex approximation

✍ V.A. Ubhaya 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 551 KB

An O(n log n) algorithm for finding all

An O(n log n) algorithm for finding all repetitions in a string

✍ Michael G Main; Richard J Lorentz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 602 KB