Skip to search formSkip to main contentSkip to account menu

APX

Known as: Log-APX, Class APX, APX (class) 
In complexity theory the class APX (an abbreviation of "approximable") is the set of NP optimization problems that allow polynomial-time… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We study the Capacitated k-Median problem, for which all the known constant factor approximation algorithms violate either the… 
2013
2013
The task of delay management is to decide whether connecting trains should wait for delayed feeder trains or depart on time in… 
2010
2010
We consider the capacity problem (or, the single slot scheduling problem) in wireless networks. Our goal is to maximize the… 
2010
2010
MIMO links enable concurrent transmissions of multiple independent data streams between a pair of nodes, which can significantly… 
2008
2008
MIMO links can significantly improve network throughput by supporting multiple concurrent data streams between a pair of nodes… 
2007
2007
This paper studies the problem of maximizing the number of correct results of dependent tasks computed unreliably. We consider a… 
Highly Cited
2006
Highly Cited
2006
In this paper we present the first set of approximation and inapproximability results for the Exemplar Breakpoint Distance… 
2006
2006
We consider the offline sorting buffers problem. Input to this problem is a sequence of requests, each specified by a point in a… 
2005
2005
This study examines phenolic peroxidase (POX) in Rhizophora mangle L. leaves in order to assess its role in phenolic manipulation…