Paper

Nov 2001

C. S. S. Eidenbenz and P.Widmayer. Inapproximability results for guarding polygons and terrains. Algorithmica, 31(1):181--192, Nov 2001.

2001

Created by ACM worker at 2019-04-18 14:54:02.0.

Simplified Graph of Associations

Word Cloud

Research Paradigm

Authors

2

results Eidenbenz CSSInapproximability PWidmayer

31 , 1 Algorithmica terrains

Referenced By

1

On Target Coverage in Mobile Visual Sensor Networks