When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? (Q4427320): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/ijoc.12.1.57.11901 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/ijoc.12.1.57.11901 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2136658137 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/IJOC.12.1.57.11901 / rank | |||
Normal rank | |||
Latest revision as of 01:27, 30 December 2024
scientific article; zbMATH DE number 1983351
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? |
scientific article; zbMATH DE number 1983351 |
Statements
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? (English)
0 references
6 November 2003
0 references
