Metaheuristic approaches for MWT and MWPT problems

It is known that the Minimum Weight Triangulation problem is NP-hard. Also the complexity of Minimum Weight Pseudo-Triangulation problem is unknown, suspecting that it is also a NP-hard problem. Therefore we focused on the development of approximate algorithms to find high quality triangulations an...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Dorzán, María Gisela, Gagliardi, Edilma Olinda, Hernández Peñalver, Gregorio, Leguizamón, Mario Guillermo
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2011
Materias:
Ciencias Informáticas
Heuristic methods
Computational Geometry and Object Modeling
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/18640
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares