Smoothed Analysis of Local Search for the Maximum-Cut Problem

DOI10.1137/1.9781611973402.66zbMath1421.68153OpenAlexW4252350499MaRDI QIDQ5384027

Heiko Röglin, Michael Etscheid

Publication date: 20 June 2019

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

Full work available at URL: https://doi.org/10.1137/1.9781611973402.66

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Smoothed Analysis of Local Search Algorithms ⋮ On percolation and ‐hardness

This page was built for publication: Smoothed Analysis of Local Search for the Maximum-Cut Problem