@inproceedings{ed5bd40bf93e448d8e5eb08545eafbff,
title = "On the practically interesting instances of MAXCUT",
abstract = "For many optimization problems, the instances of practical interest often occupy just a tiny part of the algorithm's space of instances. Following [6], we apply this perspective to MAXCUT, viewed as a clustering problem. Using a variety of techniques, we investigate practically interesting instances of this problem. Specifically, we show how to solve in polynomial time distinguished, metric, expanding and dense instances of MAXCUT under mild stability assumptions. In particular, (1 + ε)-stability (which is optimal) suffices for metric and dense MAXCUT. We also show how to solve in polynomial time (Ω√ n)-stable instances of MAXCUT, substantially improving the best previously known result.",
keywords = "Case analysis, Clustering, Hardness in practice, MAXCUT, Non worst, Stability",
author = "Yonatan Bilu and Amit Daniely and Nati Linial and Michael Saks",
year = "2013",
doi = "10.4230/LIPIcs.STACS.2013.526",
language = "American English",
isbn = "9783939897507",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
pages = "526--537",
booktitle = "30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013",
note = "30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013 ; Conference date: 27-02-2013 Through 02-03-2013",
}