Modification-Fair Cluster Editing
Fuente:
arXiv
Saved in:
| Main Authors: | Froese, Vincent, Kellerhals, Leon, Niedermeier, Rolf |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
by: Bentert, Matthias, et al.
Published: (2024)
by: Bentert, Matthias, et al.
Published: (2024)
Towards Fair Representation: Clustering and Consensus
by: Chakraborty, Diptarka, et al.
Published: (2025)
by: Chakraborty, Diptarka, et al.
Published: (2025)
Training Neural Networks is NP-Hard in Fixed Dimension
by: Froese, Vincent, et al.
Published: (2023)
by: Froese, Vincent, et al.
Published: (2023)
A Scalable Algorithm for Individually Fair K-means Clustering
by: Bateni, MohammadHossein, et al.
Published: (2024)
by: Bateni, MohammadHossein, et al.
Published: (2024)
Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
by: Maity, Binita, et al.
Published: (2024)
by: Maity, Binita, et al.
Published: (2024)
Fairness in Repetitive Scheduling
by: Hermelin, Danny, et al.
Published: (2021)
by: Hermelin, Danny, et al.
Published: (2021)
Computational Complexity of the Interval Ordering Problem
by: Pawlowski, Simeon, et al.
Published: (2026)
by: Pawlowski, Simeon, et al.
Published: (2026)
Locally Rainbow Paths
by: Fluschnik, Till, et al.
Published: (2024)
by: Fluschnik, Till, et al.
Published: (2024)
Structural Parameterizations of the Biclique-Free Vertex Deletion Problem
by: Goldmann, Lito, et al.
Published: (2023)
by: Goldmann, Lito, et al.
Published: (2023)
Dynamic Correlation Clustering in Sublinear Update Time
by: Cohen-Addad, Vincent, et al.
Published: (2024)
by: Cohen-Addad, Vincent, et al.
Published: (2024)
Designing Approximate Binary Trees for Trees
by: Kellerhals, Leon, et al.
Published: (2026)
by: Kellerhals, Leon, et al.
Published: (2026)
Fair Secretaries with Unfair Predictions
by: Balkanski, Eric, et al.
Published: (2024)
by: Balkanski, Eric, et al.
Published: (2024)
Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
by: Axiotis, Kyriakos, et al.
Published: (2024)
by: Axiotis, Kyriakos, et al.
Published: (2024)
Clustering to Minimize Cluster-Aware Norm Objectives
by: Herold, Martin G., et al.
Published: (2024)
by: Herold, Martin G., et al.
Published: (2024)
Replicable Clustering
by: Esfandiari, Hossein, et al.
Published: (2023)
by: Esfandiari, Hossein, et al.
Published: (2023)
Online Multi-Class Selection with Group Fairness Guarantee
by: Zargari, Faraz, et al.
Published: (2025)
by: Zargari, Faraz, et al.
Published: (2025)
Fairness in Monotone $k$-submodular Maximization: Algorithms and Applications
by: Zhu, Yanhui, et al.
Published: (2024)
by: Zhu, Yanhui, et al.
Published: (2024)
A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
by: Bandyapadhyay, Sayan, et al.
Published: (2024)
by: Bandyapadhyay, Sayan, et al.
Published: (2024)
A Broader View on Clustering under Cluster-Aware Norm Objectives
by: Herold, Martin G., et al.
Published: (2025)
by: Herold, Martin G., et al.
Published: (2025)
On Socially Fair Low-Rank Approximation and Column Subset Selection
by: Song, Zhao, et al.
Published: (2024)
by: Song, Zhao, et al.
Published: (2024)
Approximating Fair $k$-Min-Sum-Radii in Euclidean Space
by: Drexler, Lukas, et al.
Published: (2023)
by: Drexler, Lukas, et al.
Published: (2023)
Multilayer Correlation Clustering
by: Miyauchi, Atsushi, et al.
Published: (2024)
by: Miyauchi, Atsushi, et al.
Published: (2024)
Coreset Spectral Clustering
by: Jourdan, Ben, et al.
Published: (2025)
by: Jourdan, Ben, et al.
Published: (2025)
Placing Green Bridges Optimally, with Close-Range Habitats in Sparse Graphs
by: Wallisch, Christian, et al.
Published: (2025)
by: Wallisch, Christian, et al.
Published: (2025)
Learning-Augmented Hierarchical Clustering
by: Braverman, Vladimir, et al.
Published: (2025)
by: Braverman, Vladimir, et al.
Published: (2025)
The Harmonic Policy for Online Buffer Sharing is (2 + ln n)-Competitive: A Simple Proof
by: Addanki, Vamsi, et al.
Published: (2025)
by: Addanki, Vamsi, et al.
Published: (2025)
Learning Augmented Graph $k$-Clustering
by: Fan, Chenglin, et al.
Published: (2025)
by: Fan, Chenglin, et al.
Published: (2025)
Clustering with Non-adaptive Subset Queries
by: Black, Hadley, et al.
Published: (2024)
by: Black, Hadley, et al.
Published: (2024)
Incremental (k, z)-Clustering on Graphs
by: Cruciani, Emilio, et al.
Published: (2026)
by: Cruciani, Emilio, et al.
Published: (2026)
Hierarchical Clustering via Local Search
by: Jowhari, Hossein
Published: (2024)
by: Jowhari, Hossein
Published: (2024)
Placing Green Bridges Optimally, with a Multivariate Analysis
by: Fluschnik, Till, et al.
Published: (2021)
by: Fluschnik, Till, et al.
Published: (2021)
Dynamic Spectral Clustering with Provable Approximation Guarantee
by: Laenen, Steinar, et al.
Published: (2024)
by: Laenen, Steinar, et al.
Published: (2024)
Optimal Clustering with Dependent Costs in Bayesian Networks
by: Wu, Paul Pao-Yen, et al.
Published: (2023)
by: Wu, Paul Pao-Yen, et al.
Published: (2023)
Online Sparsification of Bipartite-Like Clusters in Graphs
by: Das, Joyentanuj, et al.
Published: (2025)
by: Das, Joyentanuj, et al.
Published: (2025)
Learning-Augmented Streaming Algorithms for Correlation Clustering
by: Dong, Yinhao, et al.
Published: (2025)
by: Dong, Yinhao, et al.
Published: (2025)
Query-Efficient Correlation Clustering with Noisy Oracle
by: Kuroki, Yuko, et al.
Published: (2024)
by: Kuroki, Yuko, et al.
Published: (2024)
Average Sensitivity of Hierarchical $k$-Median Clustering
by: Li, Shijie, et al.
Published: (2025)
by: Li, Shijie, et al.
Published: (2025)
Dynamic Consistent $k$-Center Clustering with Optimal Recourse
by: Forster, Sebastian, et al.
Published: (2024)
by: Forster, Sebastian, et al.
Published: (2024)
SpEx: A Spectral Approach to Explainable Clustering
by: Argov, Tal, et al.
Published: (2025)
by: Argov, Tal, et al.
Published: (2025)
Fair Clustering in the Sliding Window Model
by: Cohen-Addad, Vincent, et al.
Published: (2025)
by: Cohen-Addad, Vincent, et al.
Published: (2025)
Similar Items
-
The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
by: Bentert, Matthias, et al.
Published: (2024) -
Towards Fair Representation: Clustering and Consensus
by: Chakraborty, Diptarka, et al.
Published: (2025) -
Training Neural Networks is NP-Hard in Fixed Dimension
by: Froese, Vincent, et al.
Published: (2023) -
A Scalable Algorithm for Individually Fair K-means Clustering
by: Bateni, MohammadHossein, et al.
Published: (2024) -
Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
by: Maity, Binita, et al.
Published: (2024)