Imagen de Portada

Incremental (k, z)-Clustering on Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cruciani, Emilio, Forster, Sebastian, Skarlatos, Antonis
Formato:	Preprint
Publicado:	2026
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

Dynamic Consistent $k$-Center Clustering with Optimal Recourse
por: Forster, Sebastian, et al.
Publicado: (2024)

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)

Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders
por: Cruciani, Emilio, 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)

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

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

Online Sparsification of Bipartite-Like Clusters in Graphs
por: Das, Joyentanuj, et al.
Publicado: (2025)

Incremental Strongly Connected Components with Predictions
por: Deng, Ronald, et al.
Publicado: (2026)

Beyond Spectral Clustering: Probabilistic Cuts for Differentiable Graph Partitioning
por: Ghriss, Ayoub
Publicado: (2025)

Incremental Approximate Single-Source Shortest Paths with Predictions
por: McCauley, Samuel, et al.
Publicado: (2025)

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

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)

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)

A Differentially Private Clustering Algorithm for Well-Clustered Graphs
por: He, Weiqiang, et al.
Publicado: (2024)

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

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

Metric $k$-clustering using only Weak Comparison Oracles
por: Raychaudhury, Rahul, et al.
Publicado: (2026)

Learning-Augmented Algorithms for $k$-median via Online Learning
por: Hebbar, Anish, et al.
Publicado: (2026)

Approximating Fair $k$-Min-Sum-Radii in Euclidean Space
por: Drexler, Lukas, et al.
Publicado: (2023)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
por: Zhang, Guangyi, et al.
Publicado: (2026)

Top-k on a Budget: Adaptive Ranking with Weak and Strong Oracles
por: Oettershagen, Lutz
Publicado: (2026)

$k$NN Attention Demystified: A Theoretical Exploration for Scalable Transformers
por: Haris, Themistoklis
Publicado: (2024)

Clustering with Non-adaptive Subset Queries
por: Black, Hadley, et al.
Publicado: (2024)

Towards Fair Representation: Clustering and Consensus
por: Chakraborty, Diptarka, et al.
Publicado: (2025)

Hierarchical Clustering via Local Search
por: Jowhari, Hossein
Publicado: (2024)

Polynomial-time derivation of optimal k-tree topology from Markov networks
por: Dastjerdi, Fereshteh R., et al.
Publicado: (2024)

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)