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

DOI10.1016/0167-6377(86)90031-3zbMath0585.90085OpenAlexW1570355958MaRDI QIDQ1071657

Jaroslav Nešetřil, Svatopluk Poljak

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90031-3

zbMATH Keywords

max-cut problempolyhedral combinatoricsalternating cutdigital-analogue convertorsdistance-decreasing weight functionmaximal cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Related Items (3)

Unnamed Item ⋮ New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph ⋮ Max-cut in circulant graphs

Cites Work

• Weakly bipartite graphs and the max-cut problem
• Finding a Maximum Cut of a Planar Graph in Polynomial Time
• Unnamed Item
• Unnamed Item

This page was built for publication: A remark on max-cut problem with an application to digital-analogue convertors