Improving the smoothed complexity of FLIP for max cut problems

DOI10.1137/1.9781611975482.55zbMath1431.68175arXiv1807.05665OpenAlexW2949265717MaRDI QIDQ5236239

Karthekeyan Chandrasekaran, Ali Bibak, Charles Carlson

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: Improving the smoothed complexity of FLIP for max cut problems