A remark on max-cut problem with an application to digital-analogue convertors

  • Authors:

  • Jaroslav Neetil;Svatopluk Poljak

  • Affiliations:

  • KKIOV MFF UK, Charles University, 11800 Praha 1, Czechoslovakia;KM SF CVUT, Czech Technical University, 16000 Praha 6, Czechoslovakia

  • Venue:
  • Operations Research Letters
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce notions of a distance-decreasing weight function and of an alternating cut. For a class of distance-decreasing weights we solve the max-cut problem. In general, we prove that alternating cuts are near optimal. This has application to digital-analogue convertors.