On the Approximability of a Geometric Set Cover Problem

Valentin E. Brimkov, Andrew Leach, Jimmy Wu, Michael Mastroianni. On the Approximability of a Geometric Set Cover Problem. Electronic Colloquium on Computational Complexity (ECCC), 18:19, 2011. [doi]

@article{BrimkovLWM11,
  title = {On the Approximability of a Geometric Set Cover Problem},
  author = {Valentin E. Brimkov and Andrew Leach and Jimmy Wu and Michael Mastroianni},
  year = {2011},
  url = {http://eccc.hpi-web.de/report/2011/019},
  tags = {e-science},
  researchr = {https://researchr.org/publication/BrimkovLWM11},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {18},
  pages = {19},
}