◍wovepaper
SearchResearchersInstitutions
Sign in
institution

Maastricht University

Netherlands

1 paper here15 citations across 1
fields
  • cs.DS1
ROR 02jz4aj89OpenAlex

affiliations via OpenAlex

most citedk-Means has Polynomial Smoothed Complexity

15 citations

researchers with a paper here
  • Bodo Manthey1
  • David Arthur1
  • Heiko Röglin1
collaborating institutions
  • Stanford UniversityUS1 paper
  • University of TwenteNL1 paper
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2009★ 15 cited

k-Means has Polynomial Smoothed Complexity

David Arthur, Bodo Manthey, Heiko Röglin

The k-means method is one of the most widely used clustering algorithms, drawing its popularity from its speed in practice. Recently, however, it was shown to have exponential wors…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.