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

Abstract

We prove that both set cover and hitting set problems with points and axis-parallel rectangles are -hard even when (i) all rectangles share a common point and there are only two types of rectangles and for some positive integers a and b.