ACM Symposium on Theory of Computing, STOC 2015


Article Details
Title: Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
Article URLs:
Alternative Article URLs:
Authors: Shuchi Chawla
  • University of Wisconsin–Madison
Konstantin Makarychev
  • Microsoft Research
Tselil Schramm
  • UC Berkeley
Grigory Yaroslavtsev
  • University of Pennsylvania
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1320854, 1106400
DBLP Key: conf/stoc/ChawlaMSY15
Author Comments:

Discuss this paper and its artifacts below