Anup Bhattacharya

activity

20142026

most citedApproximate Clustering with Same-Cluster Queries

6 citations · 15 across the 9 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

cs.DS2019★ 5 cited

Noisy, Greedy and Not So Greedy k-means++

Anup Bhattacharya, Jan Eube, Heiko Röglin +1

The k-means++ algorithm due to Arthur and Vassilvitskii has become the most popular seeding method for Lloyd's algorithm. It samples the first center uniformly at random from the d…

cs.DS2019

Streaming PTAS for Binary $ℓ_{0}$ -Low Rank Approximation

Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal +1

We give a 3-pass, polylog-space streaming PTAS for the constrained binary $k$ -means problem and a 4-pass, polylog-space streaming PTAS for the binary $ℓ_{0}$ -low rank approximatio…

cs.DS2019

Hyperedge Estimation using Polylogarithmic Subset Queries

Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh +1

In this work, we estimate the number of hyperedges in a hypergraph $H (U (H), F (H))$ , where $U (H)$ denotes the set of vertices and ${\cal F}({\cal…

Noisy, Greedy and Not So Greedy k-means++

Streaming PTAS for Binary ℓ0​-Low Rank Approximation

Hyperedge Estimation using Polylogarithmic Subset Queries

Streaming PTAS for Binary $ℓ_{0}$ -Low Rank Approximation