A weighted version of the jump number problem on two-dimensional orders is NP-complete

被引：2

作者：

Ceroi, S ^{[1
]}

机构：

[1] LIRMM, F-34392 Montpellier 5, France

来源：

ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS | 2003年 / 20卷 / 01期

关键词：

jump number; dimension; maximal independent set;

D O I：

10.1023/A:1024417802690

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove the NP-completeness of a weighted version of the jump number problem on two-dimensional orders, by reducing the Maximum Independent Set on cubic planar graphs, using a geometrical construction.

引用

页码：1 / 11

页数：11

共 50 条

[11] A simplified NP-complete MAXSAT problem
Raman, V
Ravikumar, B
Rao, SS
INFORMATION PROCESSING LETTERS, 1998, 65 (01) : 1 - 6
[12] Via minimization problem is NP-complete
Naclerio, Nicholas J., 1604, (38):
[13] A SIMPLIFIED NP-COMPLETE SATISFIABILITY PROBLEM
TOVEY, CA
DISCRETE APPLIED MATHEMATICS, 1984, 8 (01) : 85 - 89
[14] The transposition median problem is NP-complete
Bader, Martin
THEORETICAL COMPUTER SCIENCE, 2011, 412 (12-14) : 1099 - 1110
[15] SOFTWARE CONFIGURATION AN NP-COMPLETE PROBLEM
CALABOUGH, J
DATA BASE, 1988, 19 (02): : 29 - 34
[16] THE VIA MINIMIZATION PROBLEM IS NP-COMPLETE
NACLERIO, NJ
MASUDA, S
NAKAJIMA, K
IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (11) : 1604 - 1608
[17] Attaining success is an NP-complete problem
Hemmady, S
COMPUTER, 1996, 29 (11) : 136 - 136
[18] THE GRAPH GENUS PROBLEM IS NP-COMPLETE
THOMASSEN, C
JOURNAL OF ALGORITHMS, 1989, 10 (04) : 568 - 576
[19] The Cophylogeny Reconstruction Problem Is NP-Complete
Ovadia, Y.
Fielder, D.
Conow, C.
Libeskind-Hadas, R.
JOURNAL OF COMPUTATIONAL BIOLOGY, 2011, 18 (01) : 59 - 65
[20] The two-sided (max/min, plus) problem is NP-complete
Gavalec, Martin
Ponce, Daniela
Zimmermann, Karel
PROCEEDINGS OF THE 20TH CZECH-JAPAN SEMINAR ON DATA ANALYSIS AND DECISION MAKING UNDER UNCERTAINTY, 2017, : 46 - 53

← 1 2 3 4 5 →