Skip to main content
Springer Nature Link
Log in

Approximation Schemes for Planar Graph Problems

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 197 Accesses

Years and Authors of Summarized Original Work

  • 1983; Baker

  • 1994; Baker

Problem Definition

Many NP-hard graph problems become easier to approximate on planar graphs and their generalizations. (A graph is planar if it can be drawn in the plane (or the sphere) without crossings. For definitions of other related graph classes, see the entry on Bidimensionality (2004; Demaine, Fomin, Hajiaghayi, Thilikos).) For example, a maximum independent set asks to find a maximum subset of vertices in a graph that induce no edges. This problem is inapproximable in general graphs within a factor of n1−ε for any ε > 0 unless NP  = ZPP (and inapproximable within \(n^{1/2-\epsilon }\) unless P  = NP), while for planar graphs, there is a 4-approximation (or simple 5-approximation) by taking the largest color class in a vertex 4-coloring (or 5-coloring). Another is minimum dominating set, where the goal is to find a minimum subset of vertices such that every vertex is either in or adjacent to the subset....

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Baker BS (1994) Approximation algorithms for NP-complete problems on planar graphs. J Assoc Comput Mach 41(1):153–180

    Article  MathSciNet  MATH  Google Scholar 

  2. Borradaile G, Kenyon-Mathieu C, Klein PN (2007) A polynomial-time approximation scheme for Steiner tree in planar graphs. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms (SODA’07), New Orleans

    Google Scholar 

  3. Demaine ED, Hajiaghayi M (2004) Diameter and treewidth in minor-closed graph families, revisited. Algorithmica 40(3):211–215

    Article  MathSciNet  MATH  Google Scholar 

  4. Demaine ED, Hajiaghayi M (2004) Equivalence of local treewidth and linear local treewidth and its algorithmic applications. In: Proceedings of the 15th ACM-SIAM symposium on discrete algorithms (SODA’04), New Orleans, pp 833–842

    Google Scholar 

  5. Demaine ED, Hajiaghayi M (2005) Bidimensionality: new connections between FPT algorithms and PTASs. In: Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms (SODA’05), Vancouver, pp 590–601

    Google Scholar 

  6. Demaine ED, Hajiaghayi M, Kawarabayashi K-I (2005) Algorithmic graph minor theory: decomposition, approximation, and coloring. In: Proceedings of the 46th annual IEEE symposium on foundations of computer science, Pittsburgh, pp 637–646

    Google Scholar 

  7. Demaine ED, Hajiaghayi M, Mohar B (2007) Approximation algorithms via contraction decomposition. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms (SODA’07), New Orleans, 7–9 Jan 2007, pp 278–287

    Google Scholar 

  8. Demaine ED, Hajiaghayi M, Nishimura N, Ragde P, Thilikos DM (2004) Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J Comput Syst Sci 69(2):166–195

    Article  MathSciNet  MATH  Google Scholar 

  9. DeVos M, Ding G, Oporowski B, Sanders DP, Reed B, Seymour P, Vertigan D (2004) Excluding any graph as a minor allows a low tree-width 2coloring. J Comb Theory Ser B 91(1):25–41

    Article  MathSciNet  MATH  Google Scholar 

  10. Eppstein D (2000) Diameter and treewidth in minor-closed graph families. Algorithmica 27(3–4):275–291

    Article  MathSciNet  MATH  Google Scholar 

  11. Frick M, Grohe M (2001) Deciding first-order properties of locally tree-decomposable structures. J ACM 48(6):1184–1206

    Article  MathSciNet  MATH  Google Scholar 

  12. Grohe M (2003) Local tree-width, excluded minors, and approximation algorithms. Combinatorica 23(4):613–632

    Article  MathSciNet  MATH  Google Scholar 

  13. Klein PN (2005) A linear-time approximation scheme for TSP for planar weighted graphs. In: Proceedings of the 46th IEEE symposium on foundations of computer science, Pittsburgh, pp 146–155

    Google Scholar 

  14. Klein PN (2006) A subset spanner for planar graphs, with application to subset TSP. In: Proceedings of the 38th ACM symposium on theory of computing, Seattle, pp 749–756

    Google Scholar 

  15. Lipton RJ, Tarjan RE (1979) A separator theorem for planar graphs. SIAM J Appl Math 36(2):177–189

    Article  MathSciNet  MATH  Google Scholar 

  16. Lipton RJ, Tarjan RE (1980) Applications of a planar separator theorem. SIAM J Comput 9(3):615–627

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, MD, USA

    Mohammad Taghi Hajiaghayi

  2. MIT Computer Science and Artificial Intelligence Laboratory, 32 Vassar St., Cambridge, MA, USA

    Erik D. Demaine

Authors
  1. Mohammad Taghi Hajiaghayi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Erik D. Demaine
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Mohammad Taghi Hajiaghayi or Erik D. Demaine .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Hajiaghayi, M.T., Demaine, E.D. (2016). Approximation Schemes for Planar Graph Problems. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_32

Download citation

Publish with us

Policies and ethics