Improving the Smoothed Complexity of FLIP for Max Cut Problems

DOI10.1145/3454125OpenAlexW3185749561MaRDI QIDQ5032028

Ali Bibak, Karthekeyan Chandrasekaran, Charles Carlson

Publication date: 16 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.05665

zbMATH Keywords

local searchmax-cutsmoothed analysisk-cut

Mathematics Subject Classification ID

Computer science (68-XX)

This page was built for publication: Improving the Smoothed Complexity of FLIP for Max Cut Problems