Skip to search formSkip to main contentSkip to account menu

Polynomial-time approximation scheme

Known as: Polynomial-time randomized approximation scheme, Efficient polynomial-time randomized approximation scheme, Fully polynomial approximation scheme 
In computer science, a polynomial-time approximation scheme (PTAS) is a type of approximation algorithm for optimization problems (most often, NP… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Baker devised a technique to obtain approximation schemes for many optimization problems restricted to planar graphs; her… 
2014
2014
The capacitated vehicle routing problem with time windows (CVRPTW) is a variant of the classical vehicle routing problem. In a… 
2010
2010
The fully polynomial-time approximation scheme (FPTAS) is a class of approximation algorithms that is able to deliver an… 
2010
2010
Choosing the right feature for motion based activity spotting is not a trivial task. Often, features derived by intuition or that… 
2007
2007
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection… 
2004
2004
According to the theory of NP-completeness, many problems that have important real-world applications are NP-hard. This excludes… 
2003
2003
The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad… 
2003
2003
In this work, a detailed description for an efficient adaptive mesh redistribution algorithm based on the Godunov’s scheme is… 
1998
1998
A fully polynomial approximation scheme (FPTAS) is presented for the classical 0-1 knapsack problem. The new approach…