Pages that link to "Item:Q2099670"
From MaRDI portal
The following pages link to Approximation algorithms for the capacitated correlation clustering problem with penalties (Q2099670):
Displaying 6 items.
- On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155) (← links)
- Integer programming formulations and efficient local search for relaxed correlation clustering (Q2052402) (← links)
- Approximation algorithms for the lower bounded correlation clustering problem (Q2677653) (← links)
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (Q2941510) (← links)
- Approximation Schemes for Capacitated Clustering in Doubling Metrics (Q5146927) (← links)
- A subspace derivative-free projection method for convex constrained nonlinear equations (Q6671890) (← links)