Document Open Access Logo

On the practically interesting instances of MAXCUT

Authors Yonatan Bilu, Amit Daniely, Nati Linial, Michael Saks

PDF

File

Thumbnail PDF
PDF
LIPIcs.STACS.2013.526.pdf
  • Filesize: 0.69 MB
  • 12 pages

Document Identifiers

Subject Classification

Keywords
  • MAXCUT
  • Clustering
  • Hardness in practice
  • Stability
  • Non worst-case analysis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

For many optimization problems, the instances of practical interest often occupy just a tiny part of the algorithm's space of instances.
Following (Y. Bilu and N. Linial, 2010), 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 + epsilon)-stability (which is optimal) suffices for metric and dense MAXCUT. We also show how to solve in polynomial time Omega(sqrt(n))-stable instances of MAXCUT, substantially improving the best previously known result.

Cite As Get BibTex

Yonatan Bilu, Amit Daniely, Nati Linial, and Michael Saks. On the practically interesting instances of MAXCUT. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 526-537, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013) https://doi.org/10.4230/LIPIcs.STACS.2013.526

Author Details

Yonatan Bilu
Amit Daniely
Nati Linial
Michael Saks
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact