Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{elbassioni:LIPIcs:2017:7228, author = {Khaled Elbassioni}, title = {{Finding Small Hitting Sets in Infinite Range Spaces of Bounded VCDimension}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {40:140:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770385}, ISSN = {18688969}, year = {2017}, volume = {77}, editor = {Boris Aronov and Matthew J. Katz}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7228}, URN = {urn:nbn:de:0030drops72289}, doi = {10.4230/LIPIcs.SoCG.2017.40}, annote = {Keywords: VCdimension, approximation algorithms, fractional covering, multiplicative weights update, art gallery problem, polyhedral separators, geometric cove} }
Keywords:  VCdimension, approximation algorithms, fractional covering, multiplicative weights update, art gallery problem, polyhedral separators, geometric cove  
Seminar:  33rd International Symposium on Computational Geometry (SoCG 2017)  
Issue Date:  2017  
Date of publication:  08.06.2017 