Bibak, Ali; Carlson, Charles; Chandrasekaran, Karthekeyan Improving the smoothed complexity of FLIP for max cut problems. (English) Zbl 07475098 ACM Trans. Algorithms 17, No. 3, Article No. 19, 38 p. (2021). MSC: 68-XX PDFBibTeX XMLCite \textit{A. Bibak} et al., ACM Trans. Algorithms 17, No. 3, Article No. 19, 38 p. (2021; Zbl 07475098) Full Text: DOI arXiv
Bibak, Ali; Carlson, Charles; Chandrasekaran, Karthekeyan Improving the smoothed complexity of FLIP for max cut problems. (English) Zbl 1431.68175 Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 897-916 (2019). MSC: 68W40 68R10 PDFBibTeX XMLCite \textit{A. Bibak} et al., in: Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6--9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 897--916 (2019; Zbl 1431.68175) Full Text: DOI arXiv