Login / Signup

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

Raghunath Reddy MadireddyApurva Mudgal
Published in: Inf. Process. Lett. (2019)
Keyphrases
  • set cover
  • np hard
  • approximation algorithms
  • np hardness
  • greedy algorithm
  • network flow
  • special case
  • solution space
  • probability distribution
  • greedy heuristics