Improved algorithms for uniform partitions of points

DOI10.1007/S00453-001-0084-9zbMATH Open1052.68144OpenAlexW2135499999MaRDI QIDQ1348950FDOQ1348950

Authors: Pankaj K. Agarwal, Binay Bhattacharya, Sandeep Sen 

Publication date: 21 May 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0084-9

Recommendations

• scientific article; zbMATH DE number 1522945
• Minimizing the sum of diameters efficiently
• Algorithms for projecting points to give the most uniform distribution with applications to hashing
• Three-clustering of points in the plane.
• Partitioning with two lines in the plane

zbMATH Keywords

random samplinghashingbucketing problems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cited In (1)

• Title not available (Why is that?)

Uses Software

• ROADRUNNER

This page was built for publication: Improved algorithms for uniform partitions of points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348950)