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
A Graph Spectral Approach for Computing Approximate Nash Equilibria
We present a new methodology for computing approximate Nash equilibria for two-person non-cooperative games based upon certain… 
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
Approximability and Computational Feasibility of Dodgson's Rule
Condorcet1 proposed that a winner of an election is not legitimate unless a majority of the population prefer that alternative to… 
2005
2005
Matrix Approximation and Projective Clustering via Iterative Sampling
We present two new results for the problem of approximating a given real m × n matrix A by a rank-k matrix D, where k < min{m,n… 
2004
2004
Approximate Minimum 2-Connected Subgraphs in Weighted Planar Graphs
We consider the problems of finding the minimum-weight 2-connected spanning subgraph in edge-weighted planar graphs and its… 
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… 
2002
2002
2 00 2 Parameterized Intractability of Motif Search Problems ∗
We show that Closest Substring, one of the most important problems in the field of biological sequence analysis, is W[1]-hard… 
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… 
2001
2001
On the approximability of scheduling multiprocessor tasks with time-dependent processor and time requirements
Given a set of independent dedicated multiprocessor tasks with time-dependent execution and processor requirements, our objective… 
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)