A faster algorithm for constrained correlation clustering
From MaRDI portal
Cites work
- A (3 + )-approximate correlation clustering algorithm in dynamic streams
- A fast approximation scheme for fractional covering problems with variable upper bounds
- Aggregating inconsistent information: ranking and clustering
- Almost 3-approximate correlation clustering in constant rounds
- Breaking 3-factor approximation for correlation clustering in polylogarithmic rounds
- Clustering with qualitative information
- Correlation clustering
- Correlation clustering in general weighted graphs
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Faster and simpler algorithms for multicommodity flow and other fractional packing problems
- Fitting metrics and ultrametrics with minimum disagreements
- Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
- Handling correlated rounding error via preclustering: a 1.73-approximation for correlation clustering
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and =(1/)-convergence
- Single-pass streaming algorithms for correlation clustering
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Unified acceleration method for packing and covering problems via diameter reduction
This page was built for publication: A faster algorithm for constrained correlation clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7287767)
