Approximation algorithms for the Bi-criteria weighted MAX-CUT problem

被引：0
|
作者：
Angel, E [1 ]
Bampis, E [1 ]
Gourvès, L [1 ]
机构：
[1] Univ Evry Val Essonne, CNRS, UMR 8042, LaMI, Evry, France
来源：
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE | 2005年 / 3787卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：331 / 340
页数：10
相关论文
共 50 条
  • [1] Approximation algorithms for the bi-criteria weighted MAX-CUT problem
    Angel, Eric
    Bampis, Evripidis
    Gourves, Laurent
    [J]. DISCRETE APPLIED MATHEMATICS, 2006, 154 (12) : 1685 - 1692
  • [2] Solving the Bi-criteria Max-Cut Problem with Different Neighborhood Combination Strategies
    Xue, Li-Yuan
    Zeng, Rong-Qiang
    Hu, Zheng-Yin
    Wen, Yi
    [J]. INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2017, 2017, 10585 : 508 - 515
  • [3] ALGORITHMS FOR A CLASS OF MIN-CUT AND MAX-CUT PROBLEM
    GONZALEZ, TF
    MURAYAMA, T
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 650 : 97 - 105
  • [4] Bi-criteria and approximation algorithms for restricted matchings
    Mastrolilli, Monaldo
    Stamoulis, Georgios
    [J]. THEORETICAL COMPUTER SCIENCE, 2014, 540 : 115 - 132
  • [5] Polynomial time approximation of dense weighted instances of MAX-CUT
    de la Vega, WF
    Karpinski, M
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2000, 16 (04) : 314 - 332
  • [6] Sampling subproblems of heterogeneous max-cut problems and approximation algorithms
    Drineas, Petros
    Kannan, Ravi
    Mahoney, Michael W.
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2008, 32 (03) : 307 - 333
  • [7] Solving weighted max-cut problem by global equilibrium search
    V. P. Shylo
    O. V. Shylo
    V. À. Roschyn
    [J]. Cybernetics and Systems Analysis, 2012, 48 (4) : 563 - 567
  • [8] SOLVING WEIGHTED MAX-CUT PROBLEM BY GLOBAL EQUILIBRIUM SEARCH
    Shylo, V. P.
    Shylo, O. V.
    Roschyn, V. A.
    [J]. CYBERNETICS AND SYSTEMS ANALYSIS, 2012, 48 (04) : 563 - 567
  • [9] THE EXPECTED RELATIVE ERROR OF THE POLYHEDRAL APPROXIMATION OF THE MAX-CUT PROBLEM
    POLJAK, S
    TUZA, Z
    [J]. OPERATIONS RESEARCH LETTERS, 1994, 16 (04) : 191 - 198
  • [10] EIGENVALUES AND THE MAX-CUT PROBLEM
    MOHAR, B
    POLJAK, S
    [J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 1990, 40 (02) : 343 - 352
12345