Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,094,049 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.
2016
2016
/Dimer/Al_Me_Cl/Poly/Int_p Int_p
Joan González Fabra
2016
Corpus ID: 104044653
2012
2012
Minimum Latency Gossiping in Wireless Sensor Networks
M. An
,
Nhat X. Lam
,
D. T. 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
Double digest revisited Complexity and approximability in the presence of noisy data
2011
Corpus ID: 19026423
2011
2011
On the Approximability of Minimum Topic Connected Overlay and Its Special Instances
Junko Hosoda
,
J. Hromkovic
,
Taisuke Izumi
,
H. Ono
,
Monika Steinová
,
K. Wada
International Symposium on Mathematical…
2011
Corpus ID: 18478946
In the context of designing a scalable overlay network to support decentralized topic-based pub/sub communication, the Minimum…
Expand
2008
2008
( 6 + ε )-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
Xiao-Feng Gao
,
Yao-Chun Huang
,
Zhao Zhang
,
Wei-Li Wu
2008
Corpus ID: 1406664
It was a long-standing open problem whether the minimum weight dominating set in unit disk graphs has a polynomial-time constant…
Expand
2006
2006
MAX ONES GENERALISED TO LARGER DOMAINS
Peter Jonsson
,
Fredrik Kuivinen
,
Gustav Nordh
2006
Corpus ID: 13576987
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the…
Expand
2006
2006
Approximating Visibility Problems within a Constant
E. M. Arkou
2006
Corpus ID: 15608709
Visibility problems deal with placing a minimum number of tr ansmitting stations in a region thus covering a maximum number of co…
Expand
2002
2002
Strategyproof cost-sharing Mechanisms for Set Cover and Facility Location Problems
Nikhil R. Devanur
,
M. Mihail
,
V. Vazirani
2002
Corpus ID: 3119237
Achieving truth-revealing, also called strategyproofness or incentive compatibility, is fundamental to game theory. The seminal…
Expand
1996
1996
Evaluating antibody isotype-specific ELISA, complement fixation, and ApxI hemolysin neutralization tests to detect serum antibodies in pigs infected with Actinobacillus pleuropneumoniae serotype I
Juan A. Montaraz
,
B. Fenwick
,
Howard T. Hill
,
Maureen Rider
1996
Corpus ID: 9280714
JAM: Facultad de Estudios Superiores-Cuautitlan, UNAM, Coordinacion de Estudios de Posgrado, Apartado Postal 25, Cuautitlan…
Expand
1992
1992
Homogeneous catalytic oxidation of o-substituted anilines with dioxygen in the presence of cobalt and manganese complexes
L. Simándi
,
T. Barna
,
Zoltán Szeverényi
,
S. Németh
1992
Corpus ID: 55010689
Abstract