A PTAS for vertex guarding weakly-visible polygons - An extended abstract.
Matthew J. KatzPublished in: CoRR (2018)
Keyphrases
- extended abstract
- minimum length
- approximation algorithms
- approximation schemes
- undirected graph
- helmholtz principle
- convex hull
- polynomial time approximation
- artificial intelligence
- data structure
- shortest path
- data sets
- directed graph
- visible spectrum
- spatial objects
- special case
- genetic algorithm
- machine learning
- databases