ENTITY
Mettu and Plaxton
Mettu and Plaxton
PulseAugur coverage of Mettu and Plaxton — every cluster mentioning Mettu and Plaxton across labs, papers, and developer communities, ranked by signal.
Total · 30d
0
2 over 90d
Releases · 30d
0
0 over 90d
Papers · 30d
0
2 over 90d
TIER MIX · 90D
TOPICS
RECENT · PAGE 1/1 · 2 TOTAL
-
New greedy algorithm simplifies k-median and k-means clustering
Researchers have developed a simplified and faster greedy algorithm for $k$-means and $k$-median clustering problems. This new approach improves upon the recursive greedy algorithm by Mettu and Plaxton, offering enhance…
-
New algorithm tackles dynamic (k, z)-clustering on graphs
Researchers have developed a novel randomized incremental algorithm for dynamic (k, z)-clustering on graphs. This algorithm efficiently maintains an approximate solution even as the graph undergoes adversarial edge upda…