NP-harte Probleme für minimale Polygonüberdeckungen. (NP-hard problems for minimal polygon coverings)
From MaRDI portal
Publication:811138
zbMath0734.68093MaRDI QIDQ811138
Dietmar Herwig, Hans-Dietrich Hecker
Publication date: 1988
Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/138419
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)