Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Baker's Technique

Graph Algorithm

Baker's technique is a method in theoretical computer science for designing polynomial-time approximation schemes for problems on planar graphs. It is named for Brenda Baker, who announced it at a 1983 conference and published it in the Journal of the ACM in 1994. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Facts
Classification
Design Technique
Dynamic Programming 1
Connections

In Field

Source Wikipedia: Baker's technique

Uses Design Technique

Sources
1. Wikipedia: Baker's technique
  • Lead section
    In theoretical computer science, Baker's technique is a method for designing polynomial-time approximation schemes (PTASs) for problems on planar graphs.
  • In Group: Planar Graph Algorithms, Introduction
    In theoretical computer science, Baker's technique is a method for designing polynomial-time approximation schemes (PTASs) for problems on planar graphs.
  • In Field: Algorithms and Complexity Theory, Lead paragraph
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.