Search Constraints

Start Over
Filtering by: Alternative title ssim No. 15 Remove constraint Alternative title ssim: No. 15 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) Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad 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:
    whose removal separates the remaining vertices into two disjoint parts such that there is no edge