Pages that link to "Item:Q6053495"
From MaRDI portal
The following pages link to Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem (Q6053495):
Displaying 3 items.
- On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155) (← links)
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (Q2941510) (← links)
- Improved Approximation Algorithms for Bipartite Correlation Clustering (Q3092214) (← links)