Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,346,473 papers from all fields of science
Search
Sign In
Create Free Account
Polynomial-time approximation scheme
Known as:
Polynomial-time randomized approximation scheme
, Efficient polynomial-time randomized approximation scheme
, Fully polynomial approximation scheme
Expand
In computer science, a polynomial-time approximation scheme (PTAS) is a type of approximation algorithm for optimization problems (most often, NP…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
47 relations
1-planar graph
2-satisfiability
APX
Apex graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
On the Equivalence of Two Optimal Power-Allocation Schemes for A-TWRC
Kui Xu
,
Dongmei Zhang
,
Youyun Xu
,
Wen-Feng Ma
IEEE Transactions on Vehicular Technology
2014
Corpus ID: 19103742
Power allocation (PA) is an efficient approach to enhance the system performance of an analog network coding (ANC)-based two-way…
Expand
2010
2010
Polynomial-time approximation scheme for Max-Cut problem
M. Katkov
2010
Corpus ID: 7412616
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
Sanjoy Baruah
,
N. Fisher
Real-time systems
2008
Corpus ID: 15318071
Abstract The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for…
Expand
Highly Cited
2006
Highly Cited
2006
Cryptanalysis of recently proposed Remote User Authentication Schemes
Thulasi Goriparthi
,
M. Das
,
A. Negi
,
Ashutosh Saxena
IACR Cryptology ePrint Archive
2006
Corpus ID: 5834554
Recently Manik et al. [13] proposed a novel remote user authentication scheme using bilinear pairings. Chou et al. [14…
Expand
2006
2006
An Improved Remote User Authentication Scheme with Smart Cards using Bilinear Pairings
Debasis Giri
,
P. Srivastava
IACR Cryptology ePrint Archive
2006
Corpus ID: 30645
Manik et al. [3] proposed a novel remote user authentication scheme using bilinear pairings. Recently, Fang et al [15] analyzed…
Expand
2005
2005
Fully polynomial time approximation schemes for sequential decision problems
M. Mostagir
2005
Corpus ID: 15412263
This thesis is divided into two parts sharing the common theme of fully polynomial time approximation schemes. In the first part…
Expand
2005
2005
A Polynomial Time Approximation Scheme for Feasibility Analysis in Static Priority Systems
N. Fisher
,
Sanjoy Baruah
2005
Corpus ID: 18075111
Current feasibility tests for the static priority scheduling of periodic task systems run in pseudo-polynomial time. We present…
Expand
2002
2002
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks
Xiangyang Li
,
Yang Wang
DIALM '02
2002
Corpus ID: 2620949
In wireless ad hoc networks, each wireless device has a transmission range, which is usually modeled as a disk centered at this…
Expand
2002
2002
Cultural aspects of internet privacy
Marco De Boni
,
Martyn Prigmore
2002
Corpus ID: 1753116
The problem of privacy is examined in the context of globalisation, showing that current approaches to privacy are culturally…
Expand
2001
2001
Optimization of the maximum delay of global interconnects duringlayer assignment
P. Saxena
,
C.-L. Liu
IEEE Trans. Comput. Aided Des. Integr. Circuits…
2001
Corpus ID: 35191542
Traditionally, interconnects in multilayer routing technologies have been routed greedily, one at a time. This yields good…
Expand