A Novel Efficient Approach for Solving the Art Gallery Problem

DOI10.1007/978-3-642-36065-7_3MaRDI QIDQ4915874zbMATH OpenOpenAlexFDO

Authors Alexander Kröller, Mahdi Moeini, Christiane Schmidt

Publication date 12 April 2013

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36065-7_3

zbMATH Keywords

art gallery problemDC programmingdualitylinear programmingseparationvisibility

Mathematics Subject Classification ID

Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• An approximation algorithm for the art gallery problem
• scientific article; zbMATH DE number 139794
• Exact solutions and bounds for general art gallery problems
• Exact Solutions and Bounds for General Art Gallery Problems
• A nearly optimal algorithm for covering the interior of an art gallery
• scientific article; zbMATH DE number 177851
• A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems

Cited in

(10)

• A variable neighborhood search heuristic for the maximum ratio clique problem
• Algorithms for art gallery illumination
• Solving the index tracking problem: a continuous optimization approach
• An exact algorithm for minimizing vertex guards on art galleries
• Facets for art gallery problems
• Exact Solutions and Bounds for General Art Gallery Problems
• Algorithm 966: A practical iterative algorithm for the art gallery problem using integer linear programming
• The maximum ratio clique problem: A continuous optimization approach and some new results
• Exact solutions and bounds for general art gallery problems
• A nearly optimal algorithm for covering the interior of an art gallery

This page was built for publication: A Novel Efficient Approach for Solving the Art Gallery Problem

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