Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs-Reference-Cited by-同舟云学术

Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs

Published:2015-06-14 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the forty-seventh annual ACM symposium on Theory of Computing
language:
Short-container-title:

Author:

Chawla Shuchi¹,Makarychev Konstantin²,Schramm Tselil³,Yaroslavtsev Grigory⁴

Affiliation:

1. University of Wisconsin-Madison, Madison, WI, USA

2. Microsoft Research, Redmond, WA, USA

3. UC Berkeley, Berkeley, CA, USA

4. University of Pennsylvania, Philadelphia, PA, USA

Funder

National Science Foundation

Publisher

ACM

Link

Reference28 articles.

Cited by 51 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. A new temporal interpretation of cluster editing;Journal of Computer and System Sciences;2024-09

3. Combinatorial Correlation Clustering;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. Understanding the Cluster Linear Program for Correlation Clustering;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10