@InProceedings{chan_et_al:LIPIcs.SoCG.2020.27,
  author =	{Chan, Timothy M. and He, Qizheng},
  title =	{{Faster Approximation Algorithms for Geometric Set Cover}},
  booktitle =	{36th International Symposium on Computational Geometry (SoCG 2020)},
  pages =	{27:1--27:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-143-6},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{164},
  editor =	{Cabello, Sergio and Chen, Danny Z.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.27},
  URN =		{urn:nbn:de:0030-drops-121856},
  doi =		{10.4230/LIPIcs.SoCG.2020.27},
  annote =	{Keywords: Set cover, approximation algorithms, multiplicate weight update method, random sampling, shallow cuttings}
}