Approximation algorithms to minimum vertex cover problems on polygons and terrains

Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/8933

Full metadata record

DC Field	Value	Language
dc.contributor.author	Ana Paula Tomás	pt
dc.contributor.author	António Leslie Bajuelos	pt
dc.contributor.author	Fábio Marques	pt
dc.date.accessioned	2012-09-03T14:14:38Z	-
dc.date.issued	2003	-
dc.identifier.uri	http://hdl.handle.net/10773/8933	-
dc.description.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	pt
dc.language.iso	eng	pt
dc.publisher	Springer-Verlag	pt
dc.relation	Programa de financiamento plurianual, FCT e POSI	pt
dc.rights	openAccess	por
dc.subject	Computational Geometry, Art Gallery Theorem, Orthogonal Polygons, Vertex cover Problem, Approximation Algorithms	pt
dc.title	Approximation algorithms to minimum vertex cover problems on polygons and terrains	pt
dc.type	book	pt
dc.peerreviewed	yes	pt
ua.distribution	international	pt
degois.publication.firstPage	869	pt
degois.publication.lastPage	878	pt
degois.publication.title	Computational Science - ICCS 2003	pt
degois.publication.volume	LNCS 2657	pt
dc.date.embargo	10000-01-01	-
dc.relation.publisherversion	http://www.springer.com/computer/swe/book/978-3-540-40194-0	pt
Appears in Collections:	ESTGA - Artigos

Files in This Item:

File	Description	Size	Format
2003 ICCS apt-alb-fm.pdf		248.03 kB	Adobe PDF	View/Open