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)

Related topics

Related topics

47 relations
1-planar graph2-satisfiabilityAPXApex graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Baker game and polynomial-time approximation schemes
Baker devised a technique to obtain approximation schemes for many optimization problems restricted to planar graphs; her… 
2014
2014
A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW
The capacitated vehicle routing problem with time windows (CVRPTW) is a variant of the classical vehicle routing problem. In a… 
Highly Cited
2011
Highly Cited
2011
Security enhancement on an improvement on two remote user authentication schemes using smart cards
Highly Cited
2011
Highly Cited
2011
Key Predistribution Schemes for Establishing Pairwise Keys with a Mobile Sink in Sensor Networks
Security services such as authentication and pairwise key establishment are critical to sensor networks. They enable sensor nodes… 
2010
2010
Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning
The fully polynomial-time approximation scheme (FPTAS) is a class of approximation algorithms that is able to deliver an… 
2007
2007
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection… 
2004
2004
Parameterized complexity and polynomial-time approximation schemes
According to the theory of NP-completeness, many problems that have important real-world applications are NP-hard. This excludes… 
2003
2003
On Exact and Approximation Algorithms for Distinguishing Substring Selection
The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad… 
2003
2003
Adaptive Mesh Redistibution Method Based on Godunov's Scheme
In this work, a detailed description for an efficient adaptive mesh redistribution algorithm based on the Godunov’s scheme is… 
1998
1998
A New Fully Polynomial Approximation Scheme for the Knapsack Problem
A fully polynomial approximation scheme (FPTAS) is presented for the classical 0-1 knapsack problem. The new approach… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)