ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2102.04050
  4. Cited By
A Constant Approximation Algorithm for Sequential Random-Order
  No-Substitution k-Median Clustering
v1v2 (latest)

A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering

Neural Information Processing Systems (NeurIPS), 2021
8 February 2021
Tom Hess
Michal Moshkovitz
Sivan Sabato
ArXiv (abs)PDFHTML

Papers citing "A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering"

1 / 1 papers shown
Fast Distributed k-Means with a Small Number of Rounds
Fast Distributed k-Means with a Small Number of RoundsInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2022
Tom Hess
Ron Visbord
Sivan Sabato
223
3
0
31 Jan 2022
1
Page 1 of 1