English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Approximate Range Queries for Clustering

MPS-Authors
/persons/resource/persons228565

Oh,  Eunjin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

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

Oh, E., & Ahn, H.-K. (2018). Approximate Range Queries for Clustering. In B. Speckmann, & C. D. Tóth (Eds.), 34th International Symposium on Computational Geometry (pp. 1-14). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.SoCG.2018.62.


Cite as: http://hdl.handle.net/21.11116/0000-0002-AA83-A
Abstract
There is no abstract available