David Saulpic

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 40

Top Topics

Vehicle Routing

Approximation Schemes

Top Venues

Publications

Kyriakos Axiotis, Vincent Cohen-Addad, Monika Henzinger, Sammy Jerome, Vahab Mirrokni, David Saulpic, David P. Woodruff, Michael Wunder
Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond. CoRR (2024)
Nikhil Bansal, Vincent Cohen-Addad, Milind Prabhu, David Saulpic, Chris Schwiegelshohn
Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Bounds. CoRR (2024)
Max Dupré la Tour, David Saulpic
Almost-linear Time Approximation Algorithm to Euclidean k-median and k-means. CoRR (2024)
Andrew Draganov, David Saulpic, Chris Schwiegelshohn
Settling Time vs. Accuracy Tradeoffs for Clustering Big Data. CoRR (2024)
Andrew Draganov, David Saulpic, Chris Schwiegelshohn
Settling Time vs. Accuracy Tradeoffs for Clustering Big Data. Proc. ACM Manag. Data 2 (3) (2024)
Max Dupré la Tour, Monika Henzinger, David Saulpic
Fully Dynamic k-Means Coreset in Near-Optimal Update Time. CoRR (2024)
Monika Henzinger, David Saulpic, Leonhard Sidl
-Means via Coresets. ALENEX (2024)
Max Dupré la Tour, Monika Henzinger, David Saulpic
Making Old Things New: A Unified Algorithm for Differentially Private Clustering. CoRR (2024)
Max Dupré la Tour, Monika Henzinger, David Saulpic
Differential Privacy for Clustering Under Continual Observation. CoRR (2023)
Monika Henzinger, David Saulpic, Leonhard Sidl
Experimental Evaluation of Fully Dynamic k-Means via Coresets. CoRR (2023)
Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn
Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation. CoRR (2023)
Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn
Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation. FOCS (2023)
Vincent Cohen-Addad, Anupam Gupta, Lunjia Hu, Hoon Oh, David Saulpic
An Improved Local Search Algorithm for k-Median. SODA (2022)
Vincent Cohen-Addad, Frederik Mallmann-Trenn, David Saulpic
Community Recovery in the Degree-Heterogeneous Stochastic Block Model. COLT (2022)
Vincent Cohen-Addad, Kasper Green Larsen, David Saulpic, Chris Schwiegelshohn
Towards optimal lower bounds for k-median and k-means coresets. STOC (2022)
Vincent Cohen-Addad, Kasper Green Larsen, David Saulpic, Chris Schwiegelshohn, Omar Ali Sheikh-Omar
Improved Coresets for Euclidean k-Means. NeurIPS (2022)
Vincent Cohen-Addad, Frederik Mallmann-Trenn, David Saulpic
A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees. PODC (2022)
Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi, Vahab S. Mirrokni, Andres Munoz, David Saulpic, Chris Schwiegelshohn, Sergei Vassilvitskii
Scalable Differentially Private Clustering via Hierarchically Separated Trees. CoRR (2022)
Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi, Vahab Mirrokni, Andres Muñoz Medina, David Saulpic, Chris Schwiegelshohn, Sergei Vassilvitskii
Scalable Differentially Private Clustering via Hierarchically Separated Trees. KDD (2022)
Vincent Cohen-Addad, Kasper Green Larsen, David Saulpic, Chris Schwiegelshohn
Towards Optimal Lower Bounds for k-median and k-means Coresets. CoRR (2022)
Vincent Cohen-Addad, Kasper Green Larsen, David Saulpic, Chris Schwiegelshohn, Omar Ali Sheikh-Omar
Improved Coresets for Euclidean k-Means. CoRR (2022)
Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn
A new coreset framework for clustering. STOC (2021)
Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn
A New Coreset Framework for Clustering. CoRR (2021)
Vincent Cohen-Addad, David Saulpic, Chris Schwiegelshohn
Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces. NeurIPS (2021)
Andreas Emil Feldmann, David Saulpic
Polynomial time approximation schemes for clustering in low highway dimension graphs. J. Comput. Syst. Sci. 122 (2021)
Vincent Cohen-Addad, Anupam Gupta, Lunjia Hu, Hoon Oh, David Saulpic
An Improved Local Search Algorithm for k-Median. CoRR (2021)
Vincent Cohen-Addad, Andreas Emil Feldmann, David Saulpic
Near-linear Time Approximation Schemes for Clustering in Doubling Metrics. J. ACM 68 (6) (2021)
Andreas Emil Feldmann, David Saulpic
Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. CoRR (2020)
Vincent Cohen-Addad, Adrian Kosowski, Frederik Mallmann-Trenn, David Saulpic
On the Power of Louvain in the Stochastic Block Model. NeurIPS (2020)
Andreas Emil Feldmann, David Saulpic
Polynomial Time Approximation Schemes for Clustering in Low Highway Dimension Graphs. ESA (2020)
Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic
Dominating Sets and Connected Dominating Sets in Dynamic Graphs. CoRR (2019)
Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic
Dominating Sets and Connected Dominating Sets in Dynamic Graphs. STACS (2019)
David Saulpic, Vincent Cohen-Addad, Andreas Emil Feldmann
Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics. FOCS (2019)
Vincent Cohen-Addad, Niklas Hjuler, Nikos Parotsidis, David Saulpic, Chris Schwiegelshohn
Fully Dynamic Consistent Facility Location. NeurIPS (2019)
Vincent Cohen-Addad, Andreas Emil Feldmann, David Saulpic
Near-Linear Time Approximation Schemes for Clustering in Doubling Metrics. CoRR (2018)
Amariah Becker, Philip N. Klein, David Saulpic
Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension. ESA (2018)
Amariah Becker, Philip N. Klein, David Saulpic
A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs. ESA (2017)
Rémi Géraud, Mirko Koscina, Paul Lenczner, David Naccache, David Saulpic
Generating Functionally Equivalent Programs Having Non-Isomorphic Control-Flow Graphs. CoRR (2017)
Amariah Becker, Philip N. Klein, David Saulpic
Polynomial-Time Approximation Schemes for k-Center and Bounded-Capacity Vehicle Routing in Metrics with Bounded Highway Dimension. CoRR (2017)
Rémi Géraud, Mirko Koscina, Paul Lenczner, David Naccache, David Saulpic
Generating Functionally Equivalent Programs Having Non-isomorphic Control-Flow Graphs. NordSec (2017)