Abstract.
This note investigates the boundary between polynomially-solvable Max Cut and NP Hard Max Cut instances when they are classified only on the basis of the sign pattern of the objective function coefficients, i.e., of the orthant containing the objective function vector. It turns out that the matching number of the subgraph induced by the positive edges is the key parameter that allows us to differentiate between polynomially-solvable and hard instances of the problem. We give some applications of the polynomially solvable cases.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: November 29, 2000 / Accepted: August 17, 2001 Published online: December 9, 2002
RID="★"
ID="★" The research of this author was partially supported by an NSERC Research Grant.
Rights and permissions
About this article
Cite this article
McCormick, S., Rao, M. & Rinaldi, G. Easy and difficult objective functions for max cut. Math. Program., Ser. B 94, 459–466 (2003). https://doi.org/10.1007/s10107-002-0328-8
Issue Date:
DOI: https://doi.org/10.1007/s10107-002-0328-8