Randomized approximation algorithms for planar visibility counting problem.
Sharareh AlipourMohammad GhodsiAmir JafariPublished in: Theor. Comput. Sci. (2018)
Keyphrases
- approximation algorithms
- randomized algorithms
- np hard
- special case
- vertex cover
- primal dual
- worst case
- minimum cost
- set cover
- approximation schemes
- network design problem
- open shop
- np hardness
- facility location problem
- precedence constraints
- exact algorithms
- approximation ratio
- constant factor
- computational complexity
- upper bound
- lower bound