Cover Image

Chromatic correlation clustering via cluster LP

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abbasi, Fateme, An, Hyung-Chan, Byrka, Jarosław, Lee, Changyeol, Shin, Yongho
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
by: Lee, Changyeol, et al.
Published: (2025)

Servicing Matched Client Pairs with Facilities
by: Abbasi, Fateme, et al.
Published: (2026)

Online Rounding for Set Cover under Subset Arrivals
by: Byrka, Jarosław, et al.
Published: (2025)

Optimal Learning-Augmented Algorithm for Online Bidding
by: Lee, Changyeol, et al.
Published: (2026)

1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP
by: Lee, Dahoon, et al.
Published: (2025)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
by: An, Hyung-Chan, et al.
Published: (2025)

Online Disjoint Set Covers: Randomization is not Necessary
by: Bienkowski, Marcin, et al.
Published: (2024)

On the Bidirected Cut Relaxation for Steiner Forest
by: Byrka, Jarosław, et al.
Published: (2024)

The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2
by: Byrka, Jarosław, et al.
Published: (2024)

$k$-Clustering via Iterative Randomized Rounding
by: Byrka, Jarosław, et al.
Published: (2026)

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

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
by: Abbasi, Fateme, et al.
Published: (2023)

Probing EFX via PMMS: (Non-)Existence Results in Discrete Fair Division
by: Byrka, Jarosław, et al.
Published: (2025)

Parsimonious Learning-Augmented Online Metric Matching
by: Shin, Yongho, et al.
Published: (2026)

SPARSE-PIVOT: Dynamic correlation clustering for node insertions
by: Dalirrooyfard, Mina, et al.
Published: (2025)

Search Trees on Trees via LP
by: Sadeh, Yaniv, et al.
Published: (2025)

Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation Clustering
by: Fan, Chenglin, et al.
Published: (2025)

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

The clustered Sparrow algorithm
by: Dumitrescu, Cristian
Published: (2018)

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

Approximating Multiple-Depot Capacitated Vehicle Routing via LP Rounding
by: Friggstad, Zachary, et al.
Published: (2025)

Dynamic k-center clustering with lifetimes
by: Moretti, Simone, et al.
Published: (2026)

Learning-Augmented Online Bipartite Fractional Matching
by: Choo, Davin, et al.
Published: (2025)

Improved fixed-parameter bounds for Min-Sum-Radii and Diameters $k$-clustering and their fair variants
by: Banerjee, Sandip, et al.
Published: (2025)

Multipass Linear Sketches for Geometric LP-Type Problems
by: Çekirge, N. Efe, et al.
Published: (2025)

Dynamic data summarization for hierarchical spatial clustering
by: Abduaziz, Kayumov, et al.
Published: (2024)

Dependent randomized rounding for clustering and partition systems with knapsack constraints
by: Harris, David G., et al.
Published: (2017)

Explicit Combinatoric Structures of Palindromes and Chromatic Number of Restriction Graphs
by: Amir, Amihood, et al.
Published: (2024)

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture
by: Björklund, Andreas, et al.
Published: (2024)

ShiftDTW: adapting the DTW metric for cyclic time series clustering
by: Foulon, Lucas, et al.
Published: (2024)

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
by: Goranci, Gramoz, et al.
Published: (2025)

A 4-approximation algorithm for min max correlation clustering
by: Heidrich, Holger, et al.
Published: (2023)

A near-linear time approximation scheme for $(k,\ell)$-median clustering under discrete Fréchet distance
by: Driemel, Anne, et al.
Published: (2025)

Facility Location on High-dimensional Euclidean Spaces
by: Lee, Euiwoong, et al.
Published: (2025)

Label-consistent clustering for evolving data
by: Gadekar, Ameet, et al.
Published: (2025)

Local dominance unveils clusters in networks
by: Shi, Dingyi, et al.
Published: (2022)

Mean-field Potts and random-cluster dynamics from high-entropy initializations
by: Blanca, Antonio, et al.
Published: (2024)

Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
by: German, Samuel
Published: (2026)

Sketching approximations and LP approximations for finite CSPs are related
by: Singer, Noah G., et al.
Published: (2025)

A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
by: Xiao, Hanyin, et al.
Published: (2025)