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)

Related topics

Related topics

11 relations
APXApproximation-preserving reductionComplete (complexity)Computational complexity theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Energy Efficient Algorithms for $k$ -Sink Minimum Movement Target Coverage Problem in Mobile Sensor Network
Energy consumption is a fundamental and critical issue in wireless sensor networks. Mobile sensors consume much more energy… 
2013
2013
Smart-Grid Electricity Allocation via Strip Packing with Slicing
One advantage of smart grids is that they can reduce the peak load by distributing electricity-demands over multiple short… 
Highly Cited
2012
Highly Cited
2012
Simple and Nearly Optimal Multi-Item Auctions
We provide a Polynomial Time Approximation Scheme (PTAS) for the Bayesian optimal multi-item multi-bidder auction problem under… 
2012
2012
Profit-based scheduling and channel allocation for multi-item requests in real-time on-demand data broadcast systems
2007
2007
Buying cheap is expensive: hardness of non-parametric multi-product pricing
We investigate non-parametric unit-demand pricing problems, in which we want to find revenue maximizing prices for products P… 
2004
2004
The Approximability of Three-valued MAX CSP
In the maximum constraint satisfaction problem (MAX CSP), one is given a finite collection of (possibly weighted) constraints on… 
2003
2003
Minimizing Mean Completion Time in a Batch Processing System
Abstract We consider batch processing jobs to minimize the mean completion time. A batch processing machine can handle up to $B… 
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… 
Highly Cited
2000
Highly Cited
2000
Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
The investigation of the possibility to efficiently compute approximations of hard optimization problems is one of the central… 
Highly Cited
1997
Highly Cited
1997
On the Efficiency of Polynomial Time Approximation Schemes
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)