Buscar

Borrar filtros
Filtrado por: Conference Name Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017) Eliminar la restricciónConference Name: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017) Decade 2010-2019 Eliminar la restricciónDecade: 2010-2019 Tipo de recurso Dissertation Eliminar la restricciónTipo de recurso: Dissertation

Resultados de la búsqueda

  • Approximation Schemes in Planar Graphs

    Creator:
    Zheng, Baigong
    Abstract:
    There are growing interests in designing polynomial-time approximation schemes (PTAS) for optimization problems in planar graphs. Many NP-hard problems are shown to admit PTAS in planar graphs in the last decade, including Steiner tree, Steiner forest, two- edge-connected subgraphs and so on. We follow this research line and study several...
    Resource Type:
    Dissertation