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.
2011
2011
In recent years, algorithms for computing game-theoretic solutions have been developed for real-world security domains. These… 
2010
2010
We consider the capacity problem (or, the single slot scheduling problem) in wireless networks. Our goal is to maximize the… 
2008
2008
MIMO links can significantly improve network throughput by supporting multiple concurrent data streams between a pair of nodes… 
2008
2008
When cucumber and barley leaves were sprayed with 0.5% black seed oil (BSO), rapeseed oil (R oil) and parafine oil (P oil… 
2007
2007
Variations and extensions of the basic vertex-colouring and edge-colouring models have been developed to deal with increasingly… 
2007
2007
This paper studies the problem of maximizing the number of correct results of dependent tasks computed unreliably. We consider a… 
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…