Publication:5894547

DOI10.1016/j.comgeo.2019.01.001zbMath1468.68256arXiv1607.07256MaRDI QIDQ5894547

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

Publication date: 20 March 2019

Published in: Lecture Notes in Computer Science, Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.07256

zbMATH Keywords

linear programming; approximation algorithms; NP-hardness; PTAS; unit square; segment cover

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C05: Linear programming

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms