Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons. Har-Peled, S. In Proceedings of Symposium on Computational Geometry (SoCG), pages 120, 2014.
Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons [link]Paper  bibtex   
@inproceedings{ dblp2159577,
  title = {Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons},
  author = {Sariel Har-Peled},
  author_short = {Har-Peled, S.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2014},
  key = {dblp2159577},
  id = {dblp2159577},
  biburl = {http://www.dblp.org/rec/bibtex/conf/compgeom/Har-Peled14},
  url = {http://doi.acm.org/10.1145/2582112.2582157},
  conference = {SoCG},
  pages = {120},
  text = {SoCG 2014:120},
  booktitle = {Proceedings of Symposium on Computational Geometry (SoCG)}
}

Downloads: 0