Loading...
Please wait, while we are loading the content...
Similar Documents
Inapproximability of some Art Gallery Problems (1998)
| Content Provider | CiteSeerX |
|---|---|
| Author | Eidenbenz, Stephan Stamm, Christoph Widmayer, Peter |
| Abstract | We prove that the three art gallery problems Vertex Guard Edge Guard and Point Guard for simple polygons with holes cannot be approximated by any polynomial time algorithm with a ratio of lnn for any unless NP TIMEn Olog logn We obtain our results by extending and modifying the concepts of a construction introduced in Eide |
| File Format | |
| Publisher Date | 1998-01-01 |
| Access Restriction | Open |
| Subject Keyword | Art Gallery Problem Np Timen Olog Point Guard |
| Content Type | Text |