Sign in
Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon.
Reilly Browne
Prahlad Narasimhan Kasthurirangan
Joseph S. B. Mitchell
Valentin Polishchuk
Published in:
FOCS (2023)
Keyphrases
</>
approximation algorithms
constant factor
set cover
minimum cost
np hard
special case
vertex cover
primal dual
lower bound
randomized algorithms
worst case
search space
graph cuts
convex optimization
machine learning
upper bound
computational complexity