2026-08-11T13:18:17Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7228 2024-03-06T10:40:01Z ddc:004 open_access

Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-Dimension Elbassioni, Khaled VC-dimension approximation algorithms fractional covering multiplicative weights update art gallery problem polyhedral separators geometric cove We consider the problem of finding a small hitting set in an infinite range space F=(Q,R) of bounded VC-dimension. We show that, under reasonably general assumptions, the infinite-dimensional convex relaxation can be solved (approximately) efficiently by multiplicative weight updates. As a consequence, we get an algorithm that finds, for any delta>0, a set of size O(s_F(z^*_F)) that hits (1-delta)-fraction of R (with respect to a given measure) in time proportional to log(1/delta), where s_F(1/epsilon) is the size of the smallest epsilon-net the range space admits, and z^*_F is the value of the fractional optimal solution. This exponentially improves upon previous results which achieve the same approximation guarantees with running time proportional to poly(1/delta). Our assumptions hold, for instance, in the case when the range space represents the visibility regions of a polygon in the plane, giving thus a deterministic polynomial-time O(log z^*_F)-approximation algorithm for guarding (1-delta)-fraction of the area of any given simple polygon, with running time proportional to polylog(1/delta). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Khaled Elbassioni 2017 Is Part Of LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SoCG.2017.40 urn:nbn:de:0030-drops-72289 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.40 eng https://creativecommons.org/licenses/by/3.0/legalcode