arXiv (All)
open access
Approximate Dual Separation for the Cluster LP: a 1.387 approximation for Correlation Clustering
We give a deterministic $(1.3865+ε)$-approximation for correlation clustering on complete graphs, improving the previous best factor of $1.485+ε$ of Cao et al. (STOC'24). Our first main contribution is an efficient weak separation oracle for the cluster-LP dual. Given signed vertex weights $q$, it
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Simple, scalable and effective clustering via one-dimensional projections#384954
- Community Concealment from Graph Neural Networks#625504
- Community Concealment from Graph Neural Networks#623231
- Datasets for "Watset: Local-global graph clustering with applications in sense and frame induction"#275019
- Robust Graph Clustering Network for Multiple Missing Data#1105591
Record · ID 800121
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive