✦ LIBER ✦

An optimal algorithm for the on-line closest-pair problem

✍ Scribed by C. Schwarz; M. Smid; J. Snoeyink

Book ID: 105169943
Publisher: Springer
Year: 1994
Tongue: English
Weight: 712 KB
Volume: 12
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01377181

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Optimal Algorithm for Closest-Pair Ma

An Optimal Algorithm for Closest-Pair Maintenance

✍ S. N. Bespamyatnikh 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 200 KB

A fast parallel algorithm for the closes

A fast parallel algorithm for the closest pair problem

✍ Charles R. Dyer 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 506 KB

A Reliable Randomized Algorithm for the

A Reliable Randomized Algorithm for the Closest-Pair Problem

✍ Martin Dietzfelbinger; Torben Hagerup; Jyrki Katajainen; Martti Penttonen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 361 KB

The following two computational problems are studied: Duplicate grouping: Assume that n items are given, each of which is labeled by an Ä 4 integer key from the set 0, . . . , U y 1 . Store the items in an array of size n such that items with the same key occupy a contiguous segment of the array. C

An Optimized Divide-and-Conquer Algorith

An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

✍ Pereira, José C.; Lobo, Fernando G. 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 833 KB

A Simple Randomized Sieve Algorithm for

A Simple Randomized Sieve Algorithm for the Closest-Pair Problem

✍ S. Khuller; Y. Matias 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 337 KB

An optimal algorithm for preemptive on-l

An optimal algorithm for preemptive on-line scheduling

✍ Bo Chen; André van Vliet; Gerhard J. Woeginger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 286 KB