Busca

Remover filtros
Filtragem por: Conference Name Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017) Remover Conference Name: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017) Degree Level Doctoral Remover Degree Level: Doctoral

Resultados da Busca

  • Approximation Schemes in Planar Graphs

    O Criador:
    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