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 条

[21] A modified VNS metaheuristic for max-bisection problems
Ling, Ai-fan
Xu, Cheng-xian
Tang, Le
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2008, 220 (1-2) : 413 - 421
[22] An Efficient Memetic Algorithm for the Max-Bisection Problem
Lin, Geng
Zhu, Wenxing
IEEE TRANSACTIONS ON COMPUTERS, 2014, 63 (06) : 1365 - 1376
[23] A .699-approximation algorithm for Max-Bisection
Yinyu Ye
Mathematical Programming, 2001, 90 : 101 - 111
[24] Max-cut and extendability of matchings in distance-regular graphs
Cioaba, Sebastian M.
Koolen, Jack
Li, Weiqiang
EUROPEAN JOURNAL OF COMBINATORICS, 2017, 62 : 232 - 244
[25] Finding local Max-Cut in graphs in randomized polynomial time
Gao, Lunshan
SOFT COMPUTING, 2024, 28 (04) : 3029 - 3048
[26] Partitioning planar graphs: a fast combinatorial approach for max-cut
F. Liers
G. Pardella
Computational Optimization and Applications, 2012, 51 : 323 - 344
[27] Partitioning planar graphs: a fast combinatorial approach for max-cut
Liers, F.
Pardella, G.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2012, 51 (01) : 323 - 344
[28] THE MAX-CUT PROBLEM ON GRAPHS NOT CONTRACTIBLE TO K5
BARAHONA, F
OPERATIONS RESEARCH LETTERS, 1983, 2 (03) : 107 - 111
[29] Finding local Max-Cut in graphs in randomized polynomial time
Lunshan Gao
Soft Computing, 2024, 28 : 3029 - 3048
[30] Semidefinite relaxations for max-cut
Laurent, M
THE SHARPEST CUT: THE IMPACT OF MANFRED PADBERG AND HIS WORK, 2004, 4 : 257 - 290

← 1 2 3 4 5 →