Index Catalog // ScholarsArchive@OSU

Start Over

Filtering by: Creator McCabe, Timothy M. Conference Name Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017) Committee Member Rosulek, Mike

1. 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

ScholarsArchive@OSU

1. Approximation Schemes in Planar Graphs

Limit your search

Academic Affiliation

Advisor

Commencement Year

Committee Member

Conference Name

Creator

Date

Decade

Degree Field

Degree Level

Degree Name

Language

License

Peer Reviewed

Resource Type

Rights Statement

Subject

Search Constraints

Search Results

1. Approximation Schemes in Planar Graphs

Limit your search