Imagen de Portada

Combinatorial Correlation Clustering

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cohen-Addad, Vincent, Lolck, David Rasmussen, Pilipczuk, Marcin, Thorup, Mikkel, Yan, Shuyi, Zhang, Hanwen
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Static to Dynamic Correlation Clustering
por: Cao, Nairen, et al.
Publicado: (2025)

Solving the Correlation Cluster LP in Sublinear Time
por: Cao, Nairen, et al.
Publicado: (2025)

Pivot based correlation clustering in the presence of good clusters
por: Lolck, David Rasmussen, et al.
Publicado: (2026)

Embedding Planar Graphs into Graphs of Treewidth $O(\log^{3} n)$
por: Chang, Hsien-Chih, et al.
Publicado: (2024)

A Faster Algorithm for Constrained Correlation Clustering
por: Fischer, Nick, et al.
Publicado: (2025)

Correlation Clustering Beyond the Pivot Algorithm
por: Behnezhad, Soheil, et al.
Publicado: (2024)

Understanding the Cluster LP for Correlation Clustering
por: Cao, Nairen, et al.
Publicado: (2024)

Estimating Random-Walk Probabilities in Directed Graphs
por: Bertram, Christian, et al.
Publicado: (2025)

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

Instance-Optimality in PageRank Computation
por: Thorup, Mikkel, et al.
Publicado: (2025)

Connectivity augmentation is fixed-parameter tractable
por: Korhonen, Tuukka, et al.
Publicado: (2026)

Distributed Algorithms for Euclidean Clustering
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
por: Jin, Wenyu, et al.
Publicado: (2024)

Fair Clustering in the Sliding Window Model
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs
por: Czyżewska, Jadwiga, et al.
Publicado: (2025)

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming
por: Kacham, Praneeth, et al.
Publicado: (2023)

Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation
por: Narayanan, Shyam, et al.
Publicado: (2024)

PageRank Centrality in Directed Graphs with Bounded In-Degree
por: Thorup, Mikkel, et al.
Publicado: (2025)

Combinatorial Optimization using Comparison Oracles
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
por: Marx, Dániel, et al.
Publicado: (2026)

Faster diameter computation in graphs of bounded Euler genus
por: Kluk, Kacper, et al.
Publicado: (2025)

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median
por: Cohen-Addad, Vincent, et al.
Publicado: (2022)

A Strong Linear Programming Relaxation for Weighted Tree Augmentation
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

Parameterized Complexity of MinCSP over the Point Algebra
por: Osipov, George, et al.
Publicado: (2023)

Sensitivity Sampling for $k$-Means: Worst Case and Stability Optimal Coreset Bounds
por: Bansal, Nikhil, et al.
Publicado: (2024)

Improved Combinatorial Approximations for Weighted Correlation Clustering
por: Ostovari, Mojtaba, et al.
Publicado: (2023)

Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

Bounding $\varepsilon$-scatter dimension via metric sparsity
por: Bourneuf, Romain, et al.
Publicado: (2024)

A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time
por: Huang, Shang-En, et al.
Publicado: (2016)

Faster All-Pairs Optimal Electric Car Routing
por: Dorfman, Dani, et al.
Publicado: (2025)

A Tight VC-Dimension Analysis of Clustering Coresets with Applications
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Fast Similarity Sketching
por: Dahlgaard, Søren, et al.
Publicado: (2017)

A Scalable Algorithm for Individually Fair K-means Clustering
por: Bateni, MohammadHossein, et al.
Publicado: (2024)

Coarse Balanced Separators in Fat-Minor-Free Graphs
por: Bonnet, Édouard, et al.
Publicado: (2026)

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
por: Axiotis, Kyriakos, et al.
Publicado: (2024)

Hashing for Sampling-Based Estimation
por: Aamand, Anders, et al.
Publicado: (2024)