Chris Schwiegelshohn

Available identifiers

Publication	Date of Publication	Type
Adaptive out-orientations with applications	2024-11-28	Paper
Breaching the 2 LMP approximation barrier for facility location with applications to \(k\)-median	2024-05-14	Paper
Maintaining an EDCS in general graphs: simpler, density-sensitive and with worst-case time bounds	2024-05-14	Paper
Towards optimal lower bounds for k-median and k-means coresets	2023-12-08	Paper
A new coreset framework for clustering	2023-11-14	Paper
Algorithms for fair \(k\)-clustering with multiple protected attributes	2021-12-13	Paper
Polynomial time approximation schemes for all 1-center problems on metric rational set similarities	2021-04-19	Paper
Fair coresets and streaming algorithms for fair \(k\)-means	2020-08-24	Paper
On Finding the Jaccard Center	2020-05-27	Paper
Oblivious dimension reduction for \(k\)-means: beyond subspaces and the Johnson-Lindenstrauss lemma	2020-01-30	Paper
Solving the minimum string cover problem	2019-09-12	Paper
Structural results on matching estimation with applications to streaming	2019-01-11	Paper
The power of migration for online slack scheduling	2018-03-02	Paper
https://portal.mardi4nfdi.de/entity/Q4598152	2017-12-19	Paper
Sublinear estimation of weighted matchings in dynamic data streams	2015-11-19	Paper
BICO: BIRCH meets coresets for \(k\)-means clustering	2013-09-17	Paper

This page was built for person: Chris Schwiegelshohn