Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/8933
Title: Approximation algorithms to minimum vertex cover problems on polygons and terrains
Author: Ana Paula Tomás
António Leslie Bajuelos
Fábio Marques
Keywords: Computational Geometry, Art Gallery Theorem, Orthogonal Polygons, Vertex cover Problem, Approximation Algorithms
Issue Date: 2003
Publisher: Springer-Verlag
Abstract: We propose an anytime algorithm to compute successively better approximations of the optimum of MINIMUM VERTEX GUARD. Though the presentation is focused on polygons, the work may be directly extended to terrains along the lines of [4]. A major idea in our approach is to explore dominance of visibility regions to first detect pieces that are more difficult to guard
Peer review: yes
URI: http://hdl.handle.net/10773/8933
Publisher Version: http://www.springer.com/computer/swe/book/978-3-540-40194-0
Appears in Collections:ESTGA - Artigos

Files in This Item:
File Description SizeFormat 
2003 ICCS apt-alb-fm.pdf248.03 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.