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.
2012
2012
—Gossiping is one of the most crucial applications in Wireless Sensor Networks (WSNs) which has been the focus of many… 
2011
2011
In the context of designing a scalable overlay network to support decentralized topic-based pub/sub communication, the Minimum… 
2008
2008
It was a long-standing open problem whether the minimum weight dominating set in unit disk graphs has a polynomial-time constant… 
2006
2006
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the… 
2006
2006
Visibility problems deal with placing a minimum number of tr ansmitting stations in a region thus covering a maximum number of co… 
2002
2002
Achieving truth-revealing, also called strategyproofness or incentive compatibility, is fundamental to game theory. The seminal… 
1996
1996
JAM: Facultad de Estudios Superiores-Cuautitlan, UNAM, Coordinacion de Estudios de Posgrado, Apartado Postal 25, Cuautitlan…