Image de couverture de livre

Simultaneously Approximating All Norms for Massively Parallel Correlation Clustering

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Cao, Nairen, Li, Shi, Ye, Jia
Format:	Preprint
Publié:	2024
Sujets:	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

Understanding the Cluster LP for Correlation Clustering
par: Cao, Nairen, et autres
Publié: (2024)

Static to Dynamic Correlation Clustering
par: Cao, Nairen, et autres
Publié: (2025)

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
par: Kaul, Matthias, et autres
Publié: (2025)

Solving the Correlation Cluster LP in Sublinear Time
par: Cao, Nairen, et autres
Publié: (2025)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
par: Davies, Sami, et autres
Publié: (2023)

Min-Max Correlation Clustering via Neighborhood Similarity
par: Cao, Nairen, et autres
Publié: (2025)

Improved Combinatorial Approximations for Weighted Correlation Clustering
par: Ostovari, Mojtaba, et autres
Publié: (2023)

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

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering
par: Zhou, Jianqi, et autres
Publié: (2025)

Supermodular Approximation of Norms and Applications
par: Kesselheim, Thomas, et autres
Publié: (2024)

1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP
par: Lee, Dahoon, et autres
Publié: (2025)

Entrywise Low-Rank Approximation and Matrix $p \rightarrow q$ Norms via Global Correlation Rounding
par: Anderson, Prashanti, et autres
Publié: (2026)

Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation Clustering
par: Fan, Chenglin, et autres
Publié: (2025)

Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models
par: Dalirrooyfard, Mina, et autres
Publié: (2024)

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

Online Correlation Clustering: Simultaneously Optimizing All $\ell_p$-norms
par: Davies, Sami, et autres
Publié: (2025)

Tree Embedding in High Dimensions: Dynamic and Massively Parallel
par: Goranci, Gramoz, et autres
Publié: (2025)

Streaming and Massively Parallel Algorithms for Euclidean Max-Cut
par: Menand, Nicolas, et autres
Publié: (2025)

Streaming Graph Algorithms in the Massively Parallel Computation Model
par: Czumaj, Artur, et autres
Publié: (2025)

On Parallel $k$-Center Clustering
par: Coy, Sam, et autres
Publié: (2023)

FPT Approximations for Fair Sum of Radii with Outliers and General Norm Objectives
par: Gadekar, Ameet
Publié: (2026)

Massively Parallel Algorithms for Approximate Shortest Paths
par: Dory, Michal, et autres
Publié: (2024)

Massively Parallel Minimum Spanning Tree in General Metric Spaces
par: Azarmehr, Amir, et autres
Publié: (2024)

Combinatorial Correlation Clustering
par: Cohen-Addad, Vincent, et autres
Publié: (2024)

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
par: Agarwal, Arpit, et autres
Publié: (2024)

Clustering to Minimize Cluster-Aware Norm Objectives
par: Herold, Martin G., et autres
Publié: (2024)

Optimal 4-Approximation for the Correlated Pandora's Problem
par: Bansal, Nikhil, et autres
Publié: (2025)

Correlation Clustering Beyond the Pivot Algorithm
par: Behnezhad, Soheil, et autres
Publié: (2024)

Learning-Augmented Streaming Algorithms for Correlation Clustering
par: Dong, Yinhao, et autres
Publié: (2025)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
par: Ashvinkumar, Vikrant, et autres
Publié: (2023)

On the Parameterized Approximability of (Mergeable) Sum of Radii Clustering
par: Gadekar, Ameet
Publié: (2026)

Cluster Vertex Deletion on Chordal Graphs
par: Cao, Yixin, et autres
Publié: (2026)

A Faster Algorithm for Constrained Correlation Clustering
par: Fischer, Nick, et autres
Publié: (2025)

Fair Correlation Clustering Meets Graph Parameters
par: Blaha, Johannes, et autres
Publié: (2026)

Polylogarithmic Approximation for Robust s-t Path
par: Li, Shi, et autres
Publié: (2023)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
par: Dory, Michal, et autres
Publié: (2022)

Clustering under Constraints: Efficient Parameterized Approximation Schemes
par: Bhore, Sujoy, et autres
Publié: (2025)

Estimating Correlation Clustering Cost in Node-Arrival Stream
par: Liu, Kaiwen, et autres
Publié: (2026)

Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs
par: Li, Shi
Publié: (2024)

A Broader View on Clustering under Cluster-Aware Norm Objectives
par: Herold, Martin G., et autres
Publié: (2025)