Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme

Switch Atlas

Algorithm

Polynomial-time approximation scheme

Optimization Algorithm

A polynomial-time approximation scheme, or PTAS, is a type of approximation algorithm used for optimization problems in computer science. 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
Time Complexity
Time Complexity (category)
Polynomial Time -- O(n^k) 1
Classification
Design Technique
Heuristic or Approximation 1
Sources
1. Wikipedia: Polynomial-time approximation scheme
  • PTAS: complexity O(n^c)
  • entity record, description (design-technique)
    A polynomial-time approximation scheme, or PTAS, is a type of approximation algorithm used for optimization problems in computer science.
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.