scientific article; zbMATH DE number 7525518
From MaRDI portal
Publication:5075830
DOI10.4230/LIPIcs.ESA.2019.81MaRDI QIDQ5075830
Sanjay Subramanian, Barna Saha
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1908.04976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem ⋮ Approximation algorithms for the lower bounded correlation clustering problem
Cites Work
- Going weighted: parameterized algorithms for cluster editing
- Approximate correlation clustering using same-cluster queries
- Correlation clustering in general weighted graphs
- Clustering with qualitative information
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- Correlation clustering with a fixed number of clusters
- Probability with Martingales
- Approximate Clustering with Same-Cluster Queries
- Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering
- Aggregating inconsistent information
- Aggregating inconsistent information
- Modeling the shape of the scene: A holistic representation of the spatial envelope
This page was built for publication:
