MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs

被引：22
|
作者：
Diaz, Josep [1 ]
Kaminski, Marcin
机构：
[1] Univ Politecn Catalunya, Lleguatges Sistemes Informat, ES-08034 Barcelona, Spain
[2] Rutgers State Univ, RUTCOR, Piscataway, NJ 08854 USA
来源：
THEORETICAL COMPUTER SCIENCE | 2007年 / 377卷 / 1-3期
关键词：
computational complexity; max-cut; max-bisection; NP-hard; unit disk graphs;
D O I：
10.1016/j.tcs.2007.02.013
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove that the MAX-CUT and MAX-BISECTION problems are NP-hard on unit disk graphs. We also show that X-precision aphs are planar for lambda > 1/root 2- and give a dichotomy theorem for MAX-CUT computational complexity on X-precision unit disk graphs. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：271 / 276
页数：6
相关论文
共 50 条
  • [41] Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
    Mourad Baïou
    Francisco Barahona
    Mathematical Programming, 2018, 172 : 59 - 75
  • [42] A continuation algorithm for max-cut problem
    Xu, Feng Min
    Xu, Cheng Xian
    Li, Xing Si
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2007, 23 (07) : 1257 - 1264
  • [43] A multiple penalty function method for solving Max-Bisection problems
    Xu, FM
    Xu, CX
    Xue, HG
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 173 (02) : 757 - 766
  • [44] Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem
    Baiou, Mourad
    Barahona, Francisco
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2016, 2016, 9682 : 63 - 76
  • [45] MAX-CUT BY EXCLUDING BIPARTIT SUBGRAPHS
    Wu, Shufei
    Li, Amin
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2023, 108 (02) : 177 - 186
  • [46] Rank of Handelman hierarchy for Max-Cut
    Park, Myoung-Ju
    Hong, Sung-Pil
    OPERATIONS RESEARCH LETTERS, 2011, 39 (05) : 323 - 328
  • [47] APPROXIMATION ALGORITHM FOR MAX-BISECTION PROBLEM WITH THE POSITIVE SEMIDEFINITE RELAXATION
    Da-chuan Xu Ji-ye Han(Institute of Applied Mathematics
    JournalofComputationalMathematics, 2003, (03) : 357 - 366
  • [48] A deterministic annealing algorithm for approximating a solution of the max-bisection problem
    Dang, CY
    He, LP
    Hui, IK
    NEURAL NETWORKS, 2002, 15 (03) : 441 - 458
  • [49] Approximation algorithm for Max-Bisection problem with the positive semidefinite relaxation
    Xu, DC
    Han, JY
    JOURNAL OF COMPUTATIONAL MATHEMATICS, 2003, 21 (03) : 357 - 366
  • [50] Randomized heuristics for the MAX-CUT problem
    Festa, P
    Pardalos, PM
    Resende, MGC
    Ribeiro, CC
    OPTIMIZATION METHODS & SOFTWARE, 2002, 17 (06): : 1033 - 1058
12345