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.
2013
2013
Minimum Dominating Set for a Point Set in $\IR^2$
In this article, we consider the problem of computing minimum dominating set for a given set $S$ of $n$ points in $\IR^2$. Here… 
2009
2009
Maximizing the number of accepted flows in TDMA-based wireless ad hoc networks is APX-complete
Full exploitation of the bandwidth resources of Wireless Networks is challenging because of the sharing of the radio medium among… 
2006
2006
Parameterized Intractability of Distinguishing Substring Selection
Abstract A central question in computational biology is the design of genetic markers to distinguish between two given sets of… 
2005
2005
Online Removable Square Packing
Abstract The online removable square packing problem is a two-dimen-sional version of the online removable Knapsack problem. For… 
2005
2005
Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern
We present sharper upper and lower bounds for a known polynomial-time approximation scheme due to Li, Ma and Wang [7] for the… 
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… 
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… 
2001
2001
IN-CAR COMMUNICATION USING WIRELESS TECHNOLOGY
The evolution in mobile and wireless communication technology allows passengers and drivers in vehicles to use the Internet while… 
1999
1999
Approximability of scheduling with fixed jobs
The scheduling problem of minimizing the makespan is among the most well studied problems --- especially in the field of… 
1999
1999
Multicoloring Planar Graphs and Partial k-Trees
We study the multicoloring problem with two objective functions: minimizing the makespan and minimizing the multisum. We focus on… 
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)