Further NP-hard problems for minimal polygon coverings

zbMath0758.68034MaRDI QIDQ1200939

Ralf Böttcher, Hans-Dietrich Hecker

Publication date: 16 January 1993

Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/138504

zbMATH Keywords

art gallery problems\(NP\)-problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

This page was built for publication: Further NP-hard problems for minimal polygon coverings