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 条
  • [1] Minimum Bisection Is NP-hard on Unit Disk Graphs
    Diaz, Josep
    Mertzios, George B.
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, PT II, 2014, 8635 : 251 - 262
  • [2] Minimum bisection is NP-hard on unit disk graphs
    Diaz, Josep
    Mertzios, George B.
    INFORMATION AND COMPUTATION, 2017, 256 : 83 - 92
  • [3] A note on approximating Max-Bisection on regular graphs
    Feige, U
    Karpinski, M
    Langberg, M
    INFORMATION PROCESSING LETTERS, 2001, 79 (04) : 181 - 188
  • [4] Graphs with a small max-cut
    Delorme, C
    Favaron, O
    UTILITAS MATHEMATICA, 1999, 56 : 153 - 165
  • [5] MAX-CUT IN CIRCULANT GRAPHS
    POLJAK, S
    TURZIK, D
    DISCRETE MATHEMATICS, 1992, 108 (1-3) : 379 - 392
  • [6] On the max-cut of sparse random graphs
    Gamarnik, David
    Li, Quan
    RANDOM STRUCTURES & ALGORITHMS, 2018, 52 (02) : 219 - 262
  • [7] MAX-CUT on Samplings of Dense Graphs
    Fakcharoenphol, Jittat
    Vajanopath, Phanu
    2022 19TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (JCSSE 2022), 2022,
  • [8] MAX-CUT and containment relations in graphs
    Kaminski, Marcin
    THEORETICAL COMPUTER SCIENCE, 2012, 438 : 89 - 95
  • [9] MAX-CUT and Containment Relations in Graphs
    Kaminski, Marcin
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2010, 6410 : 15 - 26
  • [10] Approximation algorithms for MAX-BISECTION on low degree regular graphs
    Karpinski, M
    Kowaluk, M
    Lingas, A
    FUNDAMENTA INFORMATICAE, 2004, 62 (3-4) : 369 - 375
12345