On PTAS for planar graph problems

Approximation algorithms for a class of planar graph problems, including planar independent set, planar vertex cover and planar dominating set, were intensively studied. The current upper bound on the running time of the polynomial time approximation schemes (PTAS) for these planar graph problems is...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Huang, Xiuzhen, Chen, Jianer
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2006
Materias:
Ciencias Informáticas
vertex
polynomial time approximation schemes (PTAS)
Graph algorithms
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/24423
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares