𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dynamic Programming for NP-Hard Problems

✍ Scribed by Xiaodong Wang; Jun Tian

Book ID
119354203
Publisher
Elsevier
Year
2011
Tongue
English
Weight
295 KB
Volume
15
Category
Article
ISSN
1877-7058

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Two NP-Hard Art-Gallery Problems for Ort
Two NP-Hard Art-Gallery Problems for Ortho-Polygons
✍ Dietmar Schuchardt; Hans-Dietrich Hecker πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 292 KB

## Abstract D. T. Lee and A. K. Lin [2] proved that VERTEX‐GUARDING and POINT‐GUARDING are NP‐hard for simple polygons. We prove that those problems are NP‐hard for ortho‐polygons, too.