A randomized approximation scheme for metric MAX-CUT

被引：22
|
作者：
de la Vega, WF [1 ]
Kenyon, C [1 ]
机构：
[1] Univ Paris 11, CNRS, LRI, F-91405 Orsay, France
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2001年 / 63卷 / 04期
关键词：
D O I：
10.1006/jcss.2001.1772
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Metric MAX-CUT is the problem of dividing a set of points in metric space into two parts so as to maximize the sum of the distances between points belonging to distinct parts. We show that metric MAX-CUT is NP-complete but has a polynomial time randomized approximation scheme. (C) 2001 Elsevier Science (USA).
引用
收藏
页码：531 / 541
页数：11
相关论文
共 50 条
  • [1] A randomized approximation scheme for metric MAX-CUT
    de la Vega, WF
    Kenyon, C
    [J]. 39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 468 - 471
  • [2] MAX-CUT has a randomized approximation scheme in dense graphs
    delaVega, WF
    [J]. RANDOM STRUCTURES & ALGORITHMS, 1996, 8 (03) : 187 - 198
  • [3] A MAX-CUT APPROXIMATION USING A GRAPH BASED MBO SCHEME
    Keetch, Blaine
    van Gennip, Yves
    [J]. DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS-SERIES B, 2019, 24 (11): : 6091 - 6139
  • [4] Randomized heuristics for the MAX-CUT problem
    Festa, P
    Pardalos, PM
    Resende, MGC
    Ribeiro, CC
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2002, 17 (06): : 1033 - 1058
  • [5] COMBINATORIAL PROPERTIES AND THE COMPLEXITY OF A MAX-CUT APPROXIMATION
    DELORME, C
    POLJAK, S
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 1993, 14 (04) : 313 - 333
  • [6] Improved approximation of Max-Cut on graphs of bounded degree
    Feige, U
    Karpinski, M
    Langberg, M
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2002, 43 (02): : 201 - 219
  • [7] 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
  • [8] 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
  • [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] Near-optimal approximation algorithm for simultaneous MAX-CUT
    Bhangale, Amey
    Khot, Subhash
    Kopparty, Swastik
    Sachdeva, Sushant
    Thiruvenkatachari, Devanathan
    [J]. SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 1407 - 1425
12345