On greedy construction heuristics for the MAX-CUT problem
by Sera Kahruman, Elif Kolotoglu, Sergiy Butenko, Illya V. Hicks
International Journal of Computational Science and Engineering (IJCSE), Vol. 3, No. 3, 2007

Abstract: Given a graph with non-negative edge weights, the MAX CUT problem is to partition the set of vertices into two subsets so that the sum of the weights of edges with endpoints in different subsets is maximised. This classical NP-hard problem finds applications in VLSI design, statistical physics, and classification among other fields. This paper compares the performance of several greedy construction heuristics for MAX-CUT problem. In particular, a new 'worst-out' approach is studied and the proposed edge contraction heuristic is shown to have an approximation ratio of at least 1/3. The results of experimental comparison of the worst-out approach, the well-known best-in algorithm, and modifications for both are also included.

Online publication date: Fri, 18-Apr-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com