Search Constraints

Start Over
Filtering by: DOI 10.1175/1520-0485(1996)026<1286:EOTSLA>2.0.CO;2 Remove constraint DOI: 10.1175/1520-0485(1996)026<1286:EOTSLA>2.0.CO;2 Conference Name Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017) Remove constraint Conference Name: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017) Degree Name Doctor of Philosophy (Ph.D.) Remove constraint Degree Name: Doctor of Philosophy (Ph.D.)

Search Results

  • 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
    Full Text:
    Approximation Schemes . . . . . . . . . . . . . . . . . . . 2 1.3.1 Balanced Separator