On the practically interesting instances of MAXCUT

Yonatan Bilu, Amit Daniely, Nati Linial, Michael Saks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

17 Scopus citations

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.

Original languageAmerican English
Title of host publication30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013
Pages526-537
Number of pages12
DOIs
StatePublished - 2013
Event30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013 - Kiel, Germany
Duration: 27 Feb 20132 Mar 2013

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume20
ISSN (Print)1868-8969

Conference

Conference30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013
Country/TerritoryGermany
CityKiel
Period27/02/132/03/13

Keywords

  • Case analysis
  • Clustering
  • Hardness in practice
  • MAXCUT
  • Non worst
  • Stability

Fingerprint

Dive into the research topics of 'On the practically interesting instances of MAXCUT'. Together they form a unique fingerprint.

Cite this