Image de couverture de livre

Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Song, Shihong, Mo, Guanlin, Yang, Qingyuan, Ding, Hu
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Sample-and-Search: An Effective Algorithm for Learning-Augmented k-Median Clustering in High dimensions
par: Cheng, Kangke, et autres
Publié: (2026)

Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms
par: Mo, Guanlin, et autres
Publié: (2024)

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Fully Dynamic Euclidean k-Means
par: Bhattacharya, Sayan, et autres
Publié: (2025)

Simple Quantum Algorithm for Approximate $k$-Mismatch Problem
par: Habib, Ruhan, et autres
Publié: (2025)

Facility Location and $k$-Median with Fair Outliers
par: Dabas, Rajni, et autres
Publié: (2025)

Logarithmic Approximations for Fair k-Set Selection
par: Li, Shi, et autres
Publié: (2025)

Constant-Factor Approximations for Doubly Constrained Fair k-Center, k-Median and k-Means
par: Funk, Nicole, et autres
Publié: (2026)

An Improved Greedy Approximation for (Metric) $k$-Means
par: Charikar, Moses, et autres
Publié: (2026)

FPT Approximations for Fair $k$-Min-Sum-Radii
par: Carta, Lena, et autres
Publié: (2024)

The $k$-Fold Matroid Secretary Problem
par: Gujjar, Rishi, et autres
Publié: (2025)

A Simple PTAS for Weighted $k$-means and Sensor Coverage
par: Pareek, Akash, et autres
Publié: (2025)

Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking
par: Chakraborty, Diptarka, et autres
Publié: (2026)

Round-efficient Fully-scalable MPC algorithms for k-Means
par: Jiang, Shaofeng H. -C., et autres
Publié: (2026)

The k-Center Problem of Uncertain Points on Graphs
par: Xu, Haitao, et autres
Publié: (2025)

Online Rounding Schemes for $ k $-Rental Problems
par: Nekouyan, Hossein, et autres
Publié: (2025)

Finite Pinwheel Scheduling: the k-Visits Problem
par: Kanellopoulos, Sotiris, et autres
Publié: (2025)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
par: la Tour, Max Dupré, et autres
Publié: (2024)

Colorful Priority $k$-Supplier
par: Chekuri, Chandra, et autres
Publié: (2024)

On the Hardness of Approximation of the Fair k-Center Problem
par: Thejaswi, Suhas
Publié: (2026)

Solving Random Planted CSPs below the $n^{k/2}$ Threshold
par: Basu, Arpon, et autres
Publié: (2025)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
par: Sun, Ming, et autres
Publié: (2022)

Fully Dynamic k-Means Coreset in Near-Optimal Update Time
par: la Tour, Max Dupré, et autres
Publié: (2024)

The Connected k-Vertex One-Center Problem on Graphs
par: Zhang, Jingru
Publié: (2024)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
par: Madani, Amirali, et autres
Publié: (2025)

Weighted $k$-Path and Other Problems in Almost $O^*(2^k)$ Deterministic Time via Dynamic Representative Sets
par: Nederlof, Jesper
Publié: (2025)

On $k$-connectivity oracles in $k$-connected graphs
par: Nutov, Zeev
Publié: (2026)

Sensitivity Sampling for $k$-Means: Worst Case and Stability Optimal Coreset Bounds
par: Bansal, Nikhil, et autres
Publié: (2024)

$k$-Clustering via Iterative Randomized Rounding
par: Byrka, Jarosław, et autres
Publié: (2026)

Two New Upper Bounds for the Maximum k-plex Problem
par: Zheng, Jiongzhi, et autres
Publié: (2023)

Time Efficient Implementation for Online $k$-server Problem on Trees
par: Khadiev, Kamil, et autres
Publié: (2024)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
par: Dai, Han, et autres
Publié: (2025)

Effective Index Construction Algorithm for Optimal $(k,η)$-cores Computation
par: Sun, Shengli, et autres
Publié: (2025)

Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than $3^k$
par: Liu, Yuxi, et autres
Publié: (2024)

Simple and efficient four-cycle counting on sparse graphs
par: Burkhardt, Paul, et autres
Publié: (2023)

Fairness in Monotone $k$-submodular Maximization: Algorithms and Applications
par: Zhu, Yanhui, et autres
Publié: (2024)

Improved Streaming Algorithm for Fair $k$-Center Clustering
par: Guo, Longkun, et autres
Publié: (2025)

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
par: Sergeev, Ivan
Publié: (2024)

Optimal-Length Labeling Schemes and Fast Algorithms for k-gathering and k-broadcasting
par: Ganczorz, Adam, et autres
Publié: (2025)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
par: Deák, Bence, et autres
Publié: (2026)