Title of article
An approximation algorithm for the maximum cut problem and its experimental analysis Original Research Article
Author/Authors
A. Bertoni، نويسنده , , P. Campadelli، نويسنده , , G. Grossi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
10
From page
3
To page
12
Abstract
An approximation algorithm for the maximum cut problem is designed and analyzed; its performance is experimentally compared with that of a neural algorithm and that of Goemans and Williamsonʹs algorithm. Although the guaranteed quality of our algorithm in the worst-case analysis is poor, we give experimental evidence that its average behavior is better than that of Goemans and Williamsonʹs algorithm.
Keywords
Optimization , Complexity , relaxation , Local search , Goemans and Williamsonיs algorithm
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885206
Link To Document