Angle covers: algorithms and complexity

DOI10.1007/978-3-030-39881-1_9MaRDI QIDQ782165zbMATH OpenOpenAlexFDO

Authors Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff, W. Evans

Publication date 22 July 2020

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Angle covers: algorithms and complexity
• Approximating the maxmin-angle covering triangulation
• The complexity of the covering radius problem
• Complexities of efficient solutions of rectilinear polygon cover problems
• Algorithms for polytope covering and approximation
• The computational complexity and approximability of a series of geometric covering problems
• Covering a simplex by spheres: complexity and algorithms
• Algorithms for Rectangular Covering Problems
• scientific article; zbMATH DE number 4128383
• Cover Algorithms and Their Combination

Cited in

(1)

• scientific article; zbMATH DE number 7760172 (Why is no real title available?)

This page was built for publication: Angle covers: algorithms and complexity

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