David Saulpic

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
An improved local search algorithm for \(k\)-median	2024-07-19	Paper
Experimental evaluation of fully dynamic \(k\)-means via coresets	2024-05-29	Paper
A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing	2024-03-26	Paper
Towards optimal lower bounds for k-median and k-means coresets Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing	2023-12-08	Paper
A new coreset framework for clustering Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing	2023-11-14	Paper
scientific article; zbMATH DE number 7651185 (Why is no real title available?)	2023-02-07	Paper
Near-linear Time Approximation Schemes for Clustering in Doubling Metrics Journal of the ACM	2022-12-08	Paper
Dominating sets and connected dominating sets in dynamic graphs (available as arXiv preprint)	2022-07-18	Paper
Polynomial time approximation schemes for clustering in low highway dimension graphs Journal of Computer and System Sciences	2021-09-17	Paper
Polynomial time approximation schemes for clustering in low highway dimension graphs Journal of Computer and System Sciences	2021-09-17	Paper
Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (available as arXiv preprint)	2021-08-04	Paper
A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs	2020-05-27	Paper

Research outcomes over time

This page was built for person: David Saulpic