Correlation clustering in data streams
From MaRDI portal
Publication:2037102
Recommendations
Cites work
- A Local-Search 2-Approximation for 2-Correlation-Clustering
- Aggregating inconsistent information: ranking and clustering
- AMS without 4-wise independence on product domains
- Approximate max-flow min-(multi)cut theorems and their applications
- Better streaming algorithms for clustering problems
- Cluster graph modification problems
- Clustering with qualitative information
- Correlation clustering
- Correlation clustering in general weighted graphs
- Correlation clustering with a fixed number of clusters
- Correlation clustering, maximizing agreements via semidefinite programming
- Data stream clustering
- Fast SDP algorithms for constraint satisfaction problems
- Graph-modeled data clustering: Exact algorithms for clique generation
- scientific article; zbMATH DE number 5485455 (Why is no real title available?)
- scientific article; zbMATH DE number 5764818 (Why is no real title available?)
- scientific article; zbMATH DE number 1256718 (Why is no real title available?)
- scientific article; zbMATH DE number 7053292 (Why is no real title available?)
- Improved approximation algorithms for MAX k-cut and MAX BISECTION
- Incremental Clustering and Dynamic Information Retrieval
- Linear programming in the semi-streaming model with application to the maximum matching problem
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- On graph problems in a semi-streaming model
- On the exact space complexity of sketching and streaming small norms
- Single pass spectral sparsification in dynamic streams
- Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
- The multiplicative weights update method: a meta-algorithm and applications
- The Probabilistic Communication Complexity of Set Intersection
Cited in
(28)- Dynamic graph stream algorithms in \(o(n)\) space
- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
- Approximation algorithms for the capacitated correlation clustering problem with penalties
- An improved approximation algorithm for capacitated correlation clustering problem
- Approximation algorithm for the capacitated correlation clustering problem with penalties
- Approximation algorithms for two variants of correlation clustering problem
- Better streaming algorithms for the maximum coverage problem
- Clustering correlated, sparse data streams to estimate a localized housing price index
- Clustering multiple data streams based on correlation analysis
- Online correlation clustering
- Sublinear algorithms for MAXCUT and correlation clustering
- Correlation Clustering
- Sublinear time and space algorithms for correlation clustering via sparse-dense decompositions
- Distributed Symmetry Breaking on Power Graphs via Sparsification
- Single-pass streaming algorithms for correlation clustering
- An improved approximation algorithm for the capacitated correlation clustering problem
- A (3 + )-approximate correlation clustering algorithm in dynamic streams
- Distributed symmetry breaking on power graphs via sparsification
- Massively parallel computation in a heterogeneous regime
- Rounds vs. communication tradeoffs for maximal independent sets
- A (3+)-approximate correlation clustering algorithm in dynamic streams
- Correlation clustering
- Matchings in low-arboricity graphs in the dynamic graph stream model
- Constructing long paths in graph streams
- Min-Max correlation clustering via neighborhood similarity
- Fitting tree metrics and ultrametrics in data streams
- A general method for estimating correlated aggregates over a data stream
This page was built for publication: Correlation clustering in data streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037102)
