( en | de | ru )

 

Disambiguation of "Bhattacharya, Anup"

Author of the publication

copydeleteadd this publication to your clipboard
A tight lower bound instance for k-means++ in constant dimension.

, , and . CoRR, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anup Bhattacharya

Vilma Anupöld

Anup Das

Anup Pradhan

Subhamoy Bhattacharya

 

Other publications of authors with the same name

Sampling in Space Restricted Settings., , , and . CoRR, (2014)Even the Easiest(?) Graph Coloring Problem is not Easy in Streaming!, , , and . CoRR, (2020)A Tight Lower Bound Instance for k-means++ in Constant Dimension., , and . TAMC, volume 8402 of Lecture Notes in Computer Science, page 7-22. Springer, (2014)Disjointness Through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond., , , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 23:1-23:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Noisy, Greedy and Not So Greedy k-means++., , , and . CoRR, (2019)Noisy, Greedy and Not so Greedy k-Means++., , , and . ESA, volume 173 of LIPIcs, page 18:1-18:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Hyperedge Estimation using Polylogarithmic Subset Queries., , , and . CoRR, (2019)Approximate Correlation Clustering Using Same-Cluster Queries., , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 14-27. Springer, (2018)Tight lower bound instances for k-means++ in two dimensions., , and . Theor. Comput. Sci., (2016)Hardness of Approximation for Euclidean k-Median., , and . APPROX-RANDOM, volume 207 of LIPIcs, page 4:1-4:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)