fully polynomial-time approximation scheme (FPTAS)
GPTKB entity
Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
algorithmic concept
|
| gptkbp:abbreviation |
fully polynomial-time approximation scheme
|
| gptkbp:category |
algorithm design
|
| gptkbp:contrastsWith |
PTAS (polynomial-time approximation scheme)
|
| gptkbp:example |
gptkb:knapsack_problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
fully polynomial-time approximation scheme (FPTAS)
|
| gptkbp:property |
produces solutions arbitrarily close to optimal
runs in time polynomial in both input size and 1/ε |
| gptkbp:relatedTo |
approximation algorithm
polynomial-time approximation scheme (PTAS) |
| gptkbp:usedFor |
optimization problems
|
| gptkbp:usedIn |
theoretical computer science
|
| gptkbp:bfsParent |
gptkb:0-1_knapsack_problem
|
| gptkbp:bfsLayer |
8
|