Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem

DOI10.1142/s0217595922400085OpenAlexW4205257522WikidataQ113343365 ScholiaQ113343365MaRDI QIDQ6053495

No author found.

Publication date: 19 October 2023

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595922400085

zbMATH Keywords

approximation algorithmintegrality gapcapacitated clusteringmin-max correlation clustering

Mathematics Subject Classification ID

Integer programming (90C10) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 3-approximation algorithm for the facility location problem with uniform capacities
• Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
• Correlation clustering
• On the capacitated vehicle routing problem
• Approximation algorithms for two variants of correlation clustering problem
• A constant FPT approximation algorithm for hard-capacitated \(k\)-means
• Local guarantees in graph cuts and clustering
• Correlation clustering in general weighted graphs
• Clustering with qualitative information
• A 5-Approximation for Capacitated Facility Location
• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
• Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds
• Correlation clustering with a fixed number of clusters
• Improved Approximation Algorithms for Bipartite Correlation Clustering
• Motif and Hypergraph Correlation Clustering
• Correlation Clustering and Biclustering With Locally Bounded Errors

This page was built for publication: Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem