NP-Hardness of the Problem of Optimal Box Positioning

被引：0
|
作者：
Galatenko, Alexei, V [1 ]
Nersisyan, Stepan A. [1 ]
Zhuk, Dmitriy N. [1 ]
机构：
[1] Lomonosov Moscow State Univ, Fac Mech & Math, Leninskie Gory 1, Moscow 119991, Russia
来源：
MATHEMATICS | 2019年 / 7卷 / 08期
基金：
俄罗斯科学基金会;
关键词：
optimal box positioning; NP-hardness; computational geometry;
D O I：
10.3390/math7080711
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We consider the problem of finding a position of a d-dimensional box with given edge lengths that maximizes the number of enclosed points of the given finite set P subset of Rd, i.e., the problem of optimal box positioning. We prove that while this problem is polynomial for fixed values of d, it is NP-hard in the general case. The proof is based on a polynomial reduction technique applied to the considered problem and the 3-CNF satisfiability problem.
引用
收藏
页数：6
相关论文
共 50 条
  • [11] NP-hardness of the sorting buffer problem on the uniform metric
    Asahiro, Yuichi
    Kawahara, Kenichi
    Miyano, Eiji
    [J]. DISCRETE APPLIED MATHEMATICS, 2012, 160 (10-11) : 1453 - 1464
  • [12] NP-hardness of the Euclidean Max-Cut problem
    A. A. Ageev
    A. V. Kel’manov
    A. V. Pyatkin
    [J]. Doklady Mathematics, 2014, 89 : 343 - 345
  • [13] NP-hardness of liveness problem of bounded asymmetric choice net
    Ohta, A
    Tsuji, K
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2002, E85A (05) : 1071 - 1074
  • [14] Troubleshooting: NP-hardness and solution methods
    M. Vomlelová
    J. Vomlel
    [J]. Soft Computing, 2003, 7 : 357 - 368
  • [15] On the NP-hardness of scheduling with time restrictions
    Zhang, An
    Chen, Yong
    Chen, Lin
    Chen, Guangting
    [J]. DISCRETE OPTIMIZATION, 2018, 28 : 54 - 62
  • [16] NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits
    Hirahara, Shuichi
    Oliveira, Igor C.
    Santhanam, Rahul
    [J]. 33RD COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2018), 2018, 102
  • [17] UG-Hardness to NP-Hardness by Losing Half
    Bhangale, Amey
    Khot, Subhash
    [J]. 34TH COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2019), 2019, 137
  • [18] NP-hardness and inapproximability of sparse PCA
    Magdon-Ismail, Malik
    [J]. INFORMATION PROCESSING LETTERS, 2017, 126 : 35 - 38
  • [19] Transitions from P to NP-hardness: the case of the Linear Ordering Problem
    Elorza, Anne
    Hernando, Leticia
    Lozano, Jose A.
    [J]. 2022 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2022,
  • [20] NP-hardness of multiple bondage in graphs
    Rad, Nader Jafari
    [J]. JOURNAL OF COMPLEXITY, 2015, 31 (05) : 754 - 761
12345