NP-hardness of geometric set cover and hitting set with rectangles containing a common point

被引：3
|
作者：
Madireddy, Raghunath Reddy [1 ]
Mudgal, Apurva [1 ]
机构：
[1] Indian Inst Technol Ropar, Dept Comp Sci & Engn, Rupnagar 140001, Punjab, India
来源：
INFORMATION PROCESSING LETTERS | 2019年 / 141卷
关键词：
Axis-parallel rectangles; Geometric set cover; Geometric hitting set; NP-hardness; Computational geometry;
D O I：
10.1016/j.ipl.2018.09.002
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We prove that both set cover and hitting set problems with points and axis-parallel rectangles are NP-hard even when (i) all rectangles share a common point and (ii) there are only two types of rectangles a x b and b x a for some positive integers a and b. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码：1 / 8
页数：8
相关论文
共 50 条
  • [1] Approximability and hardness of geometric hitting set with axis-parallel rectangles
    Madireddy, Raghunath Reddy
    Mudgal, Apurva
    [J]. INFORMATION PROCESSING LETTERS, 2019, 141 : 9 - 15
  • [2] Dynamic Geometric Set Cover and Hitting Set
    Agarwal, Pankaj
    Chang, Hsien-Chih
    Suri, Subhash
    Xiao, Allen
    Xue, Jie
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2022, 18 (04)
  • [3] NP-Hardness of Some Euclidean Problems of Partitioning a Finite Set of Points
    A. V. Kel’manov
    A. V. Pyatkin
    [J]. Computational Mathematics and Mathematical Physics, 2018, 58 : 822 - 826
  • [4] NP-Hardness of Some Euclidean Problems of Partitioning a Finite Set of Points
    Kel'manov, A. V.
    Pyatkin, A. V.
    [J]. COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2018, 58 (05) : 822 - 826
  • [5] Tight Kernels for Covering and Hitting: POINT HYPERPLANE COVER and POLYNOMIAL POINT HITTING SET
    Boissonnat, Jean-Daniel
    Dutta, Kunal
    Ghosh, Arijit
    Kolay, Sudeshna
    [J]. LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 187 - 200
  • [6] A New Point of NP-Hardness for Unique Games
    O'Donnell, Ryan
    Wright, John
    [J]. STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 289 - 306
  • [7] Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions
    Mudgal, Apurva
    Pandit, Supantha
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 211 : 143 - 162
  • [8] Weighted geometric set cover with rectangles of bounded integer side lengths
    Madireddy, Raghunath Reddy
    Mudgal, Apurva
    [J]. DISCRETE APPLIED MATHEMATICS, 2022, 315 : 36 - 55
  • [9] NP-HARDNESS OF COMPUTING PL GEOMETRIC CATEGORY IN DIMENSION
    Skotnica, Michael
    Tancer, Martin
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (03) : 2016 - 2029
  • [10] NP-hardness and evolutionary algorithm over new formulation for a Target Set Selection problem
    Ravelo, Santiago, V
    Meneses, Claudio N.
    Anacleto, Eduardo A. J.
    [J]. 2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
12345