Set Cover is a well-studied problem with application in many fields. A well-known variant of this the Minimum Membership problem: Given set points and objects, objective to cover all while minimizing maximum number objects that contain any one point. dual Hitting stab an object contains. We study both these variants geometric setting various types plane, including axis-parallel line segments, s...