Buscar
Mostrando ítems 1-4 de 4
Ponencia
Metaheuristic approaches for the minimum dilation triangulation problem
(2013)
We focus on the development of approximated algorithms to find high quality triangulations of minimum dilation because the complexity status of the Minimum Dilation Triangulation problem for a general point set is unknown. ...
Ponencia
Simulated annealing applied to the MWPT problem
(2013)
The Minimum Weight Pseudo-Triangulation (MWPT) problem is suspected to be NP-hard. We show here how Simulated Annealing (SA) can be applied for obtaining approximate solutions to the optimal ones. To do that, we applied ...
Ponencia
Distance domination, guarding and vertex cover for maximal outerplanar graphs
(2013)
In this paper we de ne a distance guarding concept on plane graphs and associate this concept with distance domination and distance vertex cover concepts on triangulation graphs. Furthermore, for any n-vertex maximal ...
Ponencia
Some results on open edge guarding of polygons
(2013)
This paper focuses on a variation of the Art Gallery problem that considers open edge guards. The “open” prefix means the endpoints of an edge where a guard is are not taken into account for visibility purposes. This paper ...