Skip to main navigation Skip to search Skip to main content

The Maximum Cut Problem

  • Clermont-Auvergne University
  • Université Paris Dauphine

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

3 Citations (Scopus)
Original languageEnglish
Title of host publicationParadigms of Combinatorial Optimization
Subtitle of host publicationProblems and New Approaches
PublisherJohn Wiley and Sons
Pages131-172
Number of pages42
Volume2
ISBN (Print)9781848211483
DOIs
Publication statusPublished - 13 Feb 2013
Externally publishedYes

Keywords

  • Approximation methods
  • Complexity/polynomial cases
  • Maximum cut, and SDP
  • Spin glass models
  • The maximum cut problem

Cite this