C. Stamm
- Inapproximability Results for Guarding Polygons and Terrains
2001/09/01 by Stephan Eidenbenz, S. Eidenbenz, Christoph Stamm +3 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Approximation algorithm #Binary logarithm #Combinatorics #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Computer science #Discrete mathematics #Geometry #Graph #Guard (computer science) #Mathematics #Point in polygon #Polygon (computer graphics) #Regular polygon #Set (abstract data type) #Set cover problem #Simple polygon #Time complexity #Vertex (graph theory) #Vertex cover