English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  Simple randomized algorithms for closest pair problems

Golin, M. J., Raman, R., Schwarz, C., & Smid, M.(1992). Simple randomized algorithms for closest pair problems (MPI-I-92-155). Saarbrücken: Max-Planck-Institut für Informatik.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-B723-B Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002D-EEED-B
Genre: Report

Files

show Files
hide Files
:
MPI-92-155.pdf (Any fulltext), 19MB
View   Save
File Permalink:
https://hdl.handle.net/11858/00-001M-0000-0027-AEAB-F
Name:
MPI-92-155.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Golin, Mordecai J.1, Author           
Raman, Rajeev1, Author           
Schwarz, Christian1, Author           
Smid, Michiel1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We present a conceptually simple, randomized incremental algorithm for finding the closest pair in a set of $n$ points in $D$-dimensional space, where $D \geq 2$ is a fixed constant. Using dynamic perfect hashing, the algorithm runs in $O(n)$ expected time. In addition to being quick on the average, this algorithm is reliable: we show that it runs in $O(n \log n / \log\log n)$ time with high probability.

Details

show
hide
Language(s): eng - English
 Dates: 1992
 Publication Status: Issued
 Pages: 14 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: Report Nr.: MPI-I-92-155
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -