de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Enumerating the k closest pairs optimally

MPS-Authors
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;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Lenhof, H.-P., & Smid, M. (1992). Enumerating the k closest pairs optimally. In 33rd Annual Symposium on Foundations of Computer Science (FOCS92) (pp. 380-386). Los Alamitos: IEEE.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-AE0A-0
Abstract
There is no abstract available