Imagen de Portada

Dynamic Consistent $k$-Center Clustering with Optimal Recourse

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Forster, Sebastian, Skarlatos, Antonis
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Incremental (k, z)-Clustering on Graphs
por: Cruciani, Emilio, et al.
Publicado: (2026)

Dynamic algorithms for k-center on graphs
por: Cruciani, Emilio, et al.
Publicado: (2023)

Adaptive Fully Dynamic $k$-Center Clustering with (Near-)Optimal Worst-Case Guarantees
por: Grilnberger, Mara, et al.
Publicado: (2026)

Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

The Cost of Consistency: Submodular Maximization with Constant Recourse
por: Dütting, Paul, et al.
Publicado: (2024)

Fully Dynamic $k$-Clustering with Fast Update Time and Small Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

Pareto Optimal Algorithmic Recourse in Multi-cost Function
por: Chen, Wen-Ling, et al.
Publicado: (2025)

Dynamic Algorithm for Explainable k-medians Clustering under lp Norm
por: Makarychev, Konstantin, et al.
Publicado: (2025)

Learning Augmented Graph $k$-Clustering
por: Fan, Chenglin, et al.
Publicado: (2025)

Average Sensitivity of Hierarchical $k$-Median Clustering
por: Li, Shijie, et al.
Publicado: (2025)

Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
por: Maity, Binita, et al.
Publicado: (2024)

Optimal Clustering with Dependent Costs in Bayesian Networks
por: Wu, Paul Pao-Yen, et al.
Publicado: (2023)

Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions
por: Cheng, Kangke, et al.
Publicado: (2026)

Dynamic Correlation Clustering in Sublinear Update Time
por: Cohen-Addad, Vincent, et al.
Publicado: (2024)

Dynamic Spectral Clustering with Provable Approximation Guarantee
por: Laenen, Steinar, et al.
Publicado: (2024)

Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
por: Funk, Nicole, et al.
Publicado: (2026)

On Parallel $k$-Center Clustering
por: Coy, Sam, et al.
Publicado: (2023)

On the Hardness of Approximation of the Fair k-Center Problem
por: Thejaswi, Suhas
Publicado: (2026)

Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
por: Braverman, Vladimir, et al.
Publicado: (2024)

TimeCluster with PCA is Equivalent to Subspace Identification of Linear Dynamical Systems
por: Hines, Christian L., et al.
Publicado: (2025)

Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach
por: Shakiba, Ali
Publicado: (2023)

Consistent Submodular Maximization
por: Dütting, Paul, et al.
Publicado: (2024)

A Simple Algorithm for Dynamic Carpooling with Recourse
por: Efron, Yuval, et al.
Publicado: (2024)

Dynamic Set Cover with Worst-Case Recourse
por: Solomon, Shay, et al.
Publicado: (2025)

Fully-Dynamic Submodular Cover with Bounded Recourse
por: Gupta, Anupam, et al.
Publicado: (2020)

Clustering to Minimize Cluster-Aware Norm Objectives
por: Herold, Martin G., et al.
Publicado: (2024)

A Faster $k$-means++ Algorithm
por: Liang, Jiehao, et al.
Publicado: (2022)

Replicable Clustering
por: Esfandiari, Hossein, et al.
Publicado: (2023)

Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems
por: Song, Shihong, et al.
Publicado: (2024)

A Broader View on Clustering under Cluster-Aware Norm Objectives
por: Herold, Martin G., et al.
Publicado: (2025)

Moderate Dimension Reduction for $k$-Center Clustering
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2023)

Multilayer Correlation Clustering
por: Miyauchi, Atsushi, et al.
Publicado: (2024)

Coreset Spectral Clustering
por: Jourdan, Ben, et al.
Publicado: (2025)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024)

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
por: Nie, Guanyu, et al.
Publicado: (2024)

Fairness in Monotone $k$-submodular Maximization: Algorithms and Applications
por: Zhu, Yanhui, et al.
Publicado: (2024)

Generalized Top-k Mallows Model for Ranked Choices
por: Haddadan, Shahrzad, et al.
Publicado: (2025)

Learning-Augmented Hierarchical Clustering
por: Braverman, Vladimir, et al.
Publicado: (2025)

Modification-Fair Cluster Editing
por: Froese, Vincent, et al.
Publicado: (2021)