Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Milind Prabhu

Milind Prabhu

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Algorithms×1

Frequent co-authors

Chris Schwiegelshohn1×
Sudarshan Shyam1×

Research Timeline

2026
Approximation Preserving Coresets

This paper introduces approximation-preserving coresets, which provide weaker guarantees than strong coresets but stronger guarantees than weak coresets for preserving the costs of good solutions in big data clustering.

Highlighted terms show continued research focus across papers

Papers

cs.DSTheoreticalRecentJun 15, 2026

Approximation Preserving Coresets

Milind Prabhu, Chris Schwiegelshohn, Sudarshan Shyam

This paper introduces approximation-preserving coresets, which provide weaker guarantees than strong coresets but stronger guarantees than weak coresets for preserving the costs of good solutions in b…

View →