Paper Info
Title
Guarding lines and 2-link polygons is apx-hard
Abstract
We prove that the minimum line covering problem andthe minimum guard covering problem restricted to 2-link polygons are APX-hard.keywords: Computational Geometry, Polygon Decomposition,Art Gallery Theorem, Minimum GuardCovering, Minimum Line Covering.1
Year
Venue
DocType
2001
CCCG
Conference
Citations 
PageRank 
References 
2
0.41
2
Authors
3
Name
Order
Citations
PageRank
Björn Brodén161.89
Mikael Hammar216316.22
Bengt J. Nilsson321024.43