✦ LIBER ✦

An improved algorithm for the fixed-radius neighbor problem

✍ Scribed by Bernard Chazelle

Book ID: 113162626
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 440 KB
Volume: 16
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(83)90123-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fixed-radius near neighbors search algor

Fixed-radius near neighbors search algorithms for points and segments

✍ Matthew T. Dickerson; R.Scot Drysdale 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 455 KB

An improved tabu search algorithm for th

An improved tabu search algorithm for the fixed-spectrum frequency-assignment problem

✍ Montemanni, R.; Moon, J.N.J.; Smith, D.H. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 536 KB

An improved K-nearest-neighbor algorithm

An improved K-nearest-neighbor algorithm for text categorization

✍ Shengyi Jiang; Guansong Pang; Meiling Wu; Limin Kuang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 452 KB

An improved fixed-parameter algorithm fo

An improved fixed-parameter algorithm for vertex cover

✍ R. Balasubramanian; Michael R. Fellows; Venkatesh Raman 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 546 KB

The VERTEX COVER problem asks, for input consisting of a graph G on n vertices, and a positive integer k, whether there is a set of k vertices such that every edge of G is incident with at least one of these vertices. We give an algorithm for this problem that runs in time O(kn + (1.324718)'k'). In

An improved algorithm for the rectangle

An improved algorithm for the rectangle enclosure problem

✍ D.T Lee; F.P Preparata 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 367 KB

An Improved Algorithm for the Traveler′s

An Improved Algorithm for the Traveler′s Problem

✍ A. Aggarwal; T. Tokuyama 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 581 KB