OpenAlex
PricingAboutJobs
Log inGet started
Work

Inapproximability Results for Guarding Polygons without Holes

HTML

Year: 1998
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Algorithms and Computation: 9th International Symposium, ISAAC’98 Taejon, Korea, December 14–16, 1998 Proceedings
DOI: 10.1007/3-540-49381-6_45
Author: Stephan Eidenbenz
Institutions: ETH Zurich, Institute of Theoretical Computer Science
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: art gallery problem, point guard, polygon guarding, hardness of approximation, NP-hardness, approximation algorithms, computational geometry

Open Access status: closed
OpenAlex ID: W1479913796
FWCI: 1.422
Cites: 11
Cited by: 53
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security