Skip to search formSkip to main contentSkip to account menu

PTAS reduction

Known as: PTAS 
In computational complexity theory, a PTAS reduction is an approximation-preserving reduction that is often used to perform reductions between… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Energy consumption is a fundamental and critical issue in wireless sensor networks. Mobile sensors consume much more energy… 
Highly Cited
2012
Highly Cited
2012
Let F be a finite set of graphs. In the F-DELETION problem, we are given an n-vertex graph G and an integer k as input, and asked… 
Highly Cited
2012
Highly Cited
2012
We provide a Polynomial Time Approximation Scheme (PTAS) for the Bayesian optimal multi-item multi-bidder auction problem under… 
Highly Cited
2011
Highly Cited
2011
In this paper, we present a constant-factor approximation algorithm for the unsplittable flow problem on a path. This improves on… 
Highly Cited
2009
Highly Cited
2009
We present approximation algorithms for maximum independent set of pseudo-disks in the plane, both in the weighted and unweighted… 
Highly Cited
2008
Highly Cited
2008
The closest string and substring problems find applications in PCR primer design, genetic probe design, motif finding, and… 
Highly Cited
2006
Highly Cited
2006
In this paper, we address the problem of gathering information in a central node of a radio network, where interference… 
2004
2004
In the maximum constraint satisfaction problem (MAX CSP), one is given a finite collection of (possibly weighted) constraints on…