Definitioncore
Polynomial-time approximation scheme (PTAS)
Also called PTAS, approximation scheme.
Family of (1+ε)-approximation algorithms for every fixed ε>0, each running in polynomial time in the input size for that ε.
Family of (1+ε)-approximation algorithms for every fixed ε>0, each running in polynomial time in the input size for that ε.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag JZX9QJ Edit this page History Report an error