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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Angel, E., Bampis, E., & Gourvès, L. (2005). Approximation algorithms for the bi-criteria weighted MAX-CUT problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3787 LNCS, pp. 331–340). https://doi.org/10.1007/11604686_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
