Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons

Sariel Har-Peled. Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons. In Siu-Wing Cheng, Olivier Devillers, editors, 30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan, June 08 - 11, 2014. pages 120, ACM, 2014. [doi]

@inproceedings{Har-Peled14,
  title = {Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons},
  author = {Sariel Har-Peled},
  year = {2014},
  doi = {10.1145/2582112.2582157},
  url = {http://doi.acm.org/10.1145/2582112.2582157},
  researchr = {https://researchr.org/publication/Har-Peled14},
  cites = {0},
  citedby = {0},
  pages = {120},
  booktitle = {30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan, June 08 - 11, 2014},
  editor = {Siu-Wing Cheng and Olivier Devillers},
  publisher = {ACM},
  isbn = {978-1-4503-2594-3},
}