Approximation algorithms to minimum vertex cover problems on polygons and terrains

Detalhes bibliográficos
Autor(a) principal: Ana Paula Tomás
Data de Publicação: 2003
Outros Autores: António Leslie Bajuelos, Fábio Marques
Tipo de documento: Livro
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10773/8933
Resumo: 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
id RCAP_b65dd4ba93594ea6b8d238e3342e1c51
oai_identifier_str oai:ria.ua.pt:10773/8933
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Approximation algorithms to minimum vertex cover problems on polygons and terrainsComputational Geometry, Art Gallery Theorem, Orthogonal Polygons, Vertex cover Problem, Approximation AlgorithmsWe 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 guardSpringer-Verlag10000-01-01T00:00:00Z2003-01-01T00:00:00Z2003info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/bookapplication/pdfhttp://hdl.handle.net/10773/8933engAna Paula TomásAntónio Leslie BajuelosFábio Marquesinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-02-22T11:15:02Zoai:ria.ua.pt:10773/8933Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T02:45:50.986065Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Approximation algorithms to minimum vertex cover problems on polygons and terrains
title Approximation algorithms to minimum vertex cover problems on polygons and terrains
spellingShingle Approximation algorithms to minimum vertex cover problems on polygons and terrains
Ana Paula Tomás
Computational Geometry, Art Gallery Theorem, Orthogonal Polygons, Vertex cover Problem, Approximation Algorithms
title_short Approximation algorithms to minimum vertex cover problems on polygons and terrains
title_full Approximation algorithms to minimum vertex cover problems on polygons and terrains
title_fullStr Approximation algorithms to minimum vertex cover problems on polygons and terrains
title_full_unstemmed Approximation algorithms to minimum vertex cover problems on polygons and terrains
title_sort Approximation algorithms to minimum vertex cover problems on polygons and terrains
author Ana Paula Tomás
author_facet Ana Paula Tomás
António Leslie Bajuelos
Fábio Marques
author_role author
author2 António Leslie Bajuelos
Fábio Marques
author2_role author
author
dc.contributor.author.fl_str_mv Ana Paula Tomás
António Leslie Bajuelos
Fábio Marques
dc.subject.por.fl_str_mv Computational Geometry, Art Gallery Theorem, Orthogonal Polygons, Vertex cover Problem, Approximation Algorithms
topic Computational Geometry, Art Gallery Theorem, Orthogonal Polygons, Vertex cover Problem, Approximation Algorithms
description 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
publishDate 2003
dc.date.none.fl_str_mv 10000-01-01T00:00:00Z
2003-01-01T00:00:00Z
2003
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/book
format book
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10773/8933
url http://hdl.handle.net/10773/8933
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Springer-Verlag
publisher.none.fl_str_mv Springer-Verlag
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799137510154043392

Registros relacionados