Approximating corridors and tours via restriction and relaxation techniques

DOI10.1145/1798596.1798609zbMath1300.68053OpenAlexW1978064083MaRDI QIDQ2930339

Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1798596.1798609

zbMATH Keywords

complexitycomputational geometryapproximation algorithmscorridorsrestriction and relaxation techniques

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (1)

Complexity of minimum corridor guarding problems

This page was built for publication: Approximating corridors and tours via restriction and relaxation techniques