S
Soham Mazumdar
Researcher at University of Illinois at Urbana–Champaign
Publications - 5
Citations - 760
Soham Mazumdar is an academic researcher from University of Illinois at Urbana–Champaign. The author has contributed to research in topics: Coreset & Correlation clustering. The author has an hindex of 5, co-authored 5 publications receiving 679 citations.
Papers
More filters
Proceedings ArticleDOI
On coresets for k-means and k-median clustering
Sariel Har-Peled,Soham Mazumdar +1 more
TL;DR: This paper shows the existence of small coresets for the problems of computing k-median/means clustering for points in low dimension, and improves the fastest known algorithms for (1+ε)-approximate k-means and k- median.
Posted Content
Coresets for $k$-Means and $k$-Median Clustering and their Applications.
Sariel Har-Peled,Soham Mazumdar +1 more
TL;DR: This paper shows the existence of small coresets for the problems of computing k-median and k-means clustering for points in low dimension, and improves the fastest known algorithms for $(1+\eps)$-approximate $k$- Means and $k-Median clustering.
Journal ArticleDOI
Fast Algorithms for Computing the Smallest k -Enclosing Circle
Sariel Har-Peled,Soham Mazumdar +1 more
TL;DR: A randomized algorithm is presented that computes in $O( n k )$ expected time such a circle, improving over previously known algorithms.
Book ChapterDOI
Fast Algorithms for Computing the Smallest k -Enclosing Disc
Sariel Har-Peled,Soham Mazumdar +1 more
TL;DR: For the problem of finding the smallest circle enclosing at least k points of a given n point set P in the plane and an integer k ≤ n, a linear time δ-approximation algorithm was proposed in this paper.
Fast algorithms for computing the smallest k-enclosing disc
Sariel Har-Peled,Soham Mazumdar +1 more
TL;DR: For the problem of finding the smallest circle enclosing at least k points of a given n point set P in the plane and an integer k ≤ n, a linear time δ-approximation algorithm was proposed in this article.