de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Bericht

Sequential and parallel algorithms for the k closest pairs problem

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44909

Lenhof,  Hans-Peter
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45509

Smid,  Michiel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)

MPI-I-92-134.pdf
(beliebiger Volltext), 12MB

Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Lenhof, H.-P., & Smid, M.(1992). Sequential and parallel algorithms for the k closest pairs problem (MPI-I-92-134). Saarbrücken: Max-Planck-Institut für Informatik.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0014-B708-9
Zusammenfassung
Let $S$ be a set of $n$ points in $D$-dimensional space, where $D$ is a constant, and let $k$ be an integer between $1$ and $n \choose 2$. A new and simpler proof is given of Salowe's theorem, i.e., a sequential algorithm is given that computes the $k$ closest pairs in the set $S$ in $O(n \log n + k)$ time, using $O(n+k)$ space. The algorithm fits in the algebraic decision tree model and is, therefore, optimal. Salowe's algorithm seems difficult to parallelize. A parallel version of our algorithm is given for the CRCW-PRAM model. This version runs in $O((\log n)^{2} \log\log n )$ expected parallel time and has an $O(n \log n \log\log n +k)$ time-processor product.