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.
2017
2017
We propose two algorithms for solving a graph partitioning problem motivated by computational topology. Specifically, given a… 
2013
2013
We study the \LowerBoundedCenter (\lbc) problem, which is a clustering problem that can be viewed as a variant of the \kCenter… 
2012
2012
Measure & Conquer (M&C) is a prominent technique for analyzing exact algorithms for computationally hard problems, in particular… 
2011
2011
In recent years, algorithms for computing game-theoretic solutions have been developed for real-world security domains. These… 
2010
2010
Sideritis scardica belonging to the Lamiaceae, also known as mountain tea, is a perennial herb that grows in the mountainous… 
2008
2008
Suppose we are given a finite set of points $P$ in $R^3$ and a collection of polytopes $mathcal{T}$ that are all translates of… 
2007
2007
Variations and extensions of the basic vertex-colouring and edge-colouring models have been developed to deal with increasingly… 
2004
2004
Modem squamates (lizards, snakes and amphisbaenians) form a highly successful group of terrestrial reptiles with a range of… 
2001
2001
Given a set of independent dedicated multiprocessor tasks with time-dependent execution and processor requirements, our objective…