Guarding Lines and 2-Link Polygons is APX-hard

DSpace Repository

Guarding Lines and 2-Link Polygons is APX-hard

Show full item record

Files for download

Facebook

Simple item record

Publication Conference Paper, other
Title Guarding Lines and 2-Link Polygons is APX-hard
Author(s) Brodén, Björn ; Hammar, Mikael ; Nilsson, Bengt J.
Date 2001
English abstract
We prove that the minimum line covering problem and the minimum guard covering problem restricted to 2-link polygons are APX-hard.
Publisher Proc. 13th Canadian Conference on Computational Geometry
Pages 45-48
Language eng (iso)
Subject(s) Computational Geometry
Art Gallery Problems
Guard Covering
Line Covering
Sciences
Research Subject Categories::MATHEMATICS::Applied mathematics::Theoretical computer science
Handle http://hdl.handle.net/2043/6645 (link to this page)

This item appears in the following Collection(s)

Show full item record

Search


Browse

My Account

Statistics