Correlation clustering with same-cluster queries bounded by optimal cost

DOI10.4230/LIPICS.ESA.2019.81MaRDI QIDQ5075830zbMATH OpenFDO

Authors Barna Saha, Sanjay Subramanian

Publication date 11 May 2022

Full work available at URL https://arxiv.org/abs/1908.04976

zbMATH Keywords

clusteringrandomized algorithmapproximation algorithmcrowdsourcing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Approximate correlation clustering using same-cluster queries
• Approximate Clustering with Same-Cluster Queries
• Correlation clustering with a fixed number of clusters
• Correlation clustering
• Semi-supervised algorithms for approximately optimal and accurate clustering

Cites work

• Aggregating inconsistent information
• Aggregating inconsistent information: ranking and clustering
• Approximate Clustering with Same-Cluster Queries
• Approximate correlation clustering using same-cluster queries
• Clustering with qualitative information
• Correlation clustering in general weighted graphs
• Correlation clustering with a fixed number of clusters
• Going weighted: parameterized algorithms for cluster editing
• Modeling the shape of the scene: A holistic representation of the spatial envelope
• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
• Probability with Martingales
• Semi-supervised algorithms for approximately optimal and accurate clustering

Cited in

(4)

• Approximate Clustering with Same-Cluster Queries
• Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem
• Approximate correlation clustering using same-cluster queries
• Approximation algorithms for the lower bounded correlation clustering problem

This page was built for publication: Correlation clustering with same-cluster queries bounded by optimal cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075830)