@InProceedings{elbassioni:LIPIcs.SoCG.2017.40,
  author =	{Elbassioni, Khaled},
  title =	{{Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-Dimension}},
  booktitle =	{33rd International Symposium on Computational Geometry (SoCG 2017)},
  pages =	{40:1--40:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-038-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{77},
  editor =	{Aronov, Boris and Katz, Matthew J.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.40},
  URN =		{urn:nbn:de:0030-drops-72289},
  doi =		{10.4230/LIPIcs.SoCG.2017.40},
  annote =	{Keywords: VC-dimension, approximation algorithms, fractional covering, multiplicative weights update, art gallery problem, polyhedral separators, geometric cove}
}