Single-Pass Streaming Algorithms for Correlation Clustering
Abstract
Formats available
You can view the full content in the following formats:
Information & Authors
Information
Published In

Copyright
History
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Combinatorial Correlation ClusteringProceedings of the 56th Annual ACM Symposium on Theory of Computing | 11 June 2024
- Understanding the Cluster Linear Program for Correlation ClusteringProceedings of the 56th Annual ACM Symposium on Theory of Computing | 11 June 2024
- O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent SetProceedings of the 56th Annual ACM Symposium on Theory of Computing | 11 June 2024
- An Objective Function-Based Clustering Algorithm with a Closed-Form Solution and Application to Reference Interval Estimation in Laboratory MedicineAlgorithms, Vol. 17, No. 4 | 29 March 2024
- Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) | 6 Nov 2023
View Options
View options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].