Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,680,307 papers from all fields of science
Search
Sign In
Create Free Account
APX
Known as:
Log-APX
, Class APX
, APX (class)
Expand
In complexity theory the class APX (an abbreviation of "approximable") is the set of NP optimization problems that allow polynomial-time…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
33 relations
Algorithm
Approximation algorithm
Approximation-preserving reduction
Bin packing problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Provable Approximations for Constrained $\ell_p$ Regression
Ibrahim Jubran
,
David Cohn
,
Dan Feldman
arXiv.org
2019
Corpus ID: 67856077
The $\ell_p$ linear regression problem is to minimize $f(x)=||Ax-b||_p$ over $x\in\mathbb{R}^d$, where $A\in\mathbb{R}^{n\times d…
Expand
2017
2017
Finding Minimal Spanning Forests in a Grap
Abdelrahman Madkour
,
P. Nadolny
,
Matthew L. Wright
arXiv.org
2017
Corpus ID: 11343967
We propose two algorithms for solving a graph partitioning problem motivated by computational topology. Specifically, given a…
Expand
2013
2013
Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small
Alina Ene
,
Sariel Har-Peled
,
Benjamin Raichel
arXiv.org
2013
Corpus ID: 15054176
We study the \LowerBoundedCenter (\lbc) problem, which is a clustering problem that can be viewed as a variant of the \kCenter…
Expand
2012
2012
Parameterized Measure & Conquer for Problems with No Small Kernels
Daniel Binkele-Raible
,
H. Fernau
Algorithmica
2012
Corpus ID: 6404663
Measure & Conquer (M&C) is a prominent technique for analyzing exact algorithms for computationally hard problems, in particular…
Expand
2012
2012
Minimum Latency Gossiping in Wireless Sensor Networks
Min Kyung An
,
Nhat X. Lam
,
D. Huynh
,
Trac N. Nguyen
2012
Corpus ID: 18967669
—Gossiping is one of the most crucial applications in Wireless Sensor Networks (WSNs) which has been the focus of many…
Expand
2011
2011
Approximation Algorithm for Security Games with Costly Resources
Sayan Bhattacharya
,
Vincent Conitzer
,
Kamesh Munagala
Workshop on Internet and Network Economics
2011
Corpus ID: 7735571
In recent years, algorithms for computing game-theoretic solutions have been developed for real-world security domains. These…
Expand
2010
2010
EFFECT OF ENDOMYCORRHIZAL COLONIZATION WITH GLOMUS INTRARADICES ON GROWTH AND ANTIOXIDANT CAPACITY OF SIDERITIS SCARDICA GRISEB
M. Hristozkova
,
P. Yonova
,
M. Boychinova
2010
Corpus ID: 8787421
Sideritis scardica belonging to the Lamiaceae, also known as mountain tea, is a perennial herb that grows in the mountainous…
Expand
2008
2008
Geometric Set Cover and Hitting Sets for Polytopes in $R^3$
S. Laue
Symposium on Theoretical Aspects of Computer…
2008
Corpus ID: 130068
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…
Expand
2007
2007
Chromatic Scheduling
D. Werra
2007
Corpus ID: 264784109
Variations and extensions of the basic vertex-colouring and edge-colouring models have been developed to deal with increasingly…
Expand
2004
2004
The osteology and myology of the craniocervical region in squamate reptile: A comparative study.
A.M.A. Al-Hassawi
2004
Corpus ID: 87670669
Modem squamates (lizards, snakes and amphisbaenians) form a highly successful group of terrestrial reptiles with a range of…
Expand