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)

Related topics

Related topics

33 relations
AlgorithmApproximation algorithmApproximation-preserving reductionBin packing problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Election Control with Voters' Uncertainty: Hardness and Approximation Results
The election control problem asks to find a set of nodes in a social network of voters to be the starters of a political campaign… 
2017
2017
Finding Minimal Spanning Forests in a Grap
We propose two algorithms for solving a graph partitioning problem motivated by computational topology. Specifically, given a… 
2016
2016
/Dimer/Al_Me_Cl/Poly/Int_p Int_p
2012
2012
Minimum Spanning Trees, Perfect Matchings and Cycle Covers Over Stochastic Points in Metric Spaces
We consider the stochastic graph model where the location of each vertex is a random point in a given metric space. We study the… 
2012
2012
Invariance And Inner Fractals In Polynomial And Transcendental Fractals
A lot of formal and informal recreational study took place in the fields of Meromorphic Maps, since Mandelbrot popularized the… 
2011
2011
Approximation Algorithm for Security Games with Costly Resources
In recent years, algorithms for computing game-theoretic solutions have been developed for real-world security domains. These… 
2007
2007
Chromatic Scheduling
Variations and extensions of the basic vertex-colouring and edge-colouring models have been developed to deal with increasingly… 
2007
2007
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional… 
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… 
1992
1992
Homogeneous catalytic oxidation of o-substituted anilines with dioxygen in the presence of cobalt and manganese complexes
Abstract