seabet app download Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering
Report time:8month14Sunday (Monday) afternoon16:30
Reporting location: Information Building535
Report Introduction:We consider the classic Correlation Clustering problem: Given a complete graph where edges are labeled either + or -, the goal is to find a partition of the vertices that minimizes the number of the +edges across parts plus the number of the -edges within parts. Recently, Cohen-Addad, Lee and Newman presented a 1.994-approximation algorithm for the problem using the Sherali-Adams hierarchy, hence breaking through the integrality gap of 2 for the classic linear program and improving upon the 2.06-approximation of Chawla, Makarychev, Schramm and Yaroslavtsev. We significantly improve the state-of-the-art by seabet app download providing a 1.73-approximation for the problem. Our approach introduces a preclustering of Correlation Clustering instances that allows us to essentially ignore the error arising from the round correlateding used by Cohen-Addad et al. This additional power simplifies the previous algorithm and analysis. More importantly, it enables a new set-based rounding that complements the previous roundings. A combination of these two rounding algorithms yields the improved bound. This is based on joint work with Cohen-Addad, Lee and Newman. The paper will appear in FOCS 2023.
About the speaker:
Master Li，Professor of Nanjing University、Doctoral seabet mobile Supervisor。Graduated from the Department of Computer Science and Technology, Tsinghua University，And the first Yao Qizhi theoretical computer science experimental class。Received PhD from Princeton University，Later worked as an assistant research professor at Toyota Institute of Technology in Chicago，Assistant Professor at the State University of New York at Buffalo，Merge in2020.2023Joined Nanjing University at the beginning of the year。Professor Li Shi’s research direction is in the field of theoretical computer science and algorithm design。He made major breakthroughs on several classic and basic issues，Solved many seabet mobile open problems that had not been solved for more than ten years。Multiple results were obtained at first-class conferences in theoretical computer scienceICALP 2011Won the best student paper award by a single author, top conference in the fieldFOCS 2012Best paper award and flagship journal in the field of computer science Journal of the ACM (JACM)Up. Multiple results were published in the highest journal of theoretical computer scienceSIAM Journal on Computing (SICOMP) on, andACM Transactions on Algorithms (TALG)，Information and Computation(I&C)and other first-class international journals. He isFOCS, STOCandSODAPublished seabet online sports betting articles at top conferences in three major fields30Remaining articles.
