Chrome Extension
WeChat Mini Program
Use on ChatGLM
VIPCreated with Sketch.

NP-hardness of Geometric Set Cover and Hitting Set with Rectangles Containing a Common Point

Raghunath Reddy Madireddy,Apurva Mudgal

INFORMATION PROCESSING LETTERS（2019）

Cited 3|Views12
No score
Abstract
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×b and b×a for some positive integers a and b.
More
Translated text
Key words
Axis-parallel rectangles,Geometric set cover,Geometric hitting set,NP-hardness,Computational geometry
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined