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.
2016
2016
Security and Efficiency Enhancement of Robust ID Based Mutual Authentication and Key Agreement Scheme Preserving User Anonymity in Mobile Networks
With the swift growth of wireless technologies, an increasing number of users rely on the mobile services which can exchange… 
2014
2014
On the Equivalence of Two Optimal Power-Allocation Schemes for A-TWRC
Power allocation (PA) is an efficient approach to enhance the system performance of an analog network coding (ANC)-based two-way… 
2010
2010
Polynomial-time approximation scheme for Max-Cut problem
The community convinced me that this peace of crank was written by crackpot trisector. I apologize for disturbing community. 
2008
2008
Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems
Abstract The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for… 
Highly Cited
2006
Highly Cited
2006
Cryptanalysis of recently proposed Remote User Authentication Schemes
Recently Manik et al. [13] proposed a novel remote user authentication scheme using bilinear pairings. Chou et al. [14… 
2006
2006
An Improved Remote User Authentication Scheme with Smart Cards using Bilinear Pairings
Manik et al. [3] proposed a novel remote user authentication scheme using bilinear pairings. Recently, Fang et al [15] analyzed… 
2005
2005
Fully polynomial time approximation schemes for sequential decision problems
This thesis is divided into two parts sharing the common theme of fully polynomial time approximation schemes. In the first part… 
2005
2005
A Polynomial Time Approximation Scheme for Feasibility Analysis in Static Priority Systems
Current feasibility tests for the static priority scheduling of periodic task systems run in pseudo-polynomial time. We present… 
2002
2002
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks
In wireless ad hoc networks, each wireless device has a transmission range, which is usually modeled as a disk centered at this… 
1997
1997
A new cache replacement scheme based on backpropagation neural networks
In this paper, we present a new neural network-based algorithm, KORA (Khalid ShadOw Replacement Algorithm), that uses…