TY - GEN
T1 - On the practically interesting instances of MAXCUT
AU - Bilu, Yonatan
AU - Daniely, Amit
AU - Linial, Nati
AU - Saks, Michael
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
KW - Case analysis
KW - Clustering
KW - Hardness in practice
KW - MAXCUT
KW - Non worst
KW - Stability
UR - http://www.scopus.com/inward/record.url?scp=84892561385&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.STACS.2013.526
DO - 10.4230/LIPIcs.STACS.2013.526
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84892561385
SN - 9783939897507
T3 - Leibniz International Proceedings in Informatics, LIPIcs
SP - 526
EP - 537
BT - 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013
T2 - 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013
Y2 - 27 February 2013 through 2 March 2013
ER -