Search Constraints

Start Over
Filtering by: Creator Bateman, Brenda O. Remove constraint Creator: Bateman, Brenda O. 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) Advisor Borradaile, Glencora Remove constraint Advisor: Borradaile, Glencora

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:
    graphs runs in O(mn) time by combining the algorithms of King et al. [85] and Orlin [104], where m and n