Approximation Algorithms for the Bi-criteria Weighted max-cut Problem

Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and the non-existence of feasible cuts that are at the same time near optimal for both criteria. Furthermore, two approximation algorithms with performance guarantee are presented. The first one is deterministic while the second one is randomized.

• Type: Conference
• Year: 2005
• Where: WG
• Authors: Eric Angel, Evripidis Bampis, Laurent Gourvès
• Keywords: Classical Max-cut Problem, Computer Science, Feasible Cuts, Objective Functions, WG 2005