Covering segments with unit squares

DOI10.1007/978-3-319-62127-2_1MaRDI QIDQ6830068zbMATH OpenFDO

Authors Ankush Acharyya, Subhas C. Nandy, Supantha Pandit, Sasanka Roy

Publication date 22 September 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

linear programmingapproximation algorithmsNP-hardnessPTASunit squaresegment cover

Mathematics Subject Classification ID

Linear programming (90C05) Applications of mathematical programming (90C90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

This page was built for publication: Covering segments with unit squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6830068)