Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,330,513 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.
2015
2015
An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ε capacity violation
J. Byrka
,
Bartosz Rybicki
,
Sumedha Uniyal
arXiv.org
2015
Corpus ID: 11008796
We study the Capacitated k-Median problem, for which all the known constant factor approximation algorithms violate either the…
Expand
2013
2013
Simultaneous optimization of delay management decisions and passenger routes
M. Schmidt
Public Transport
2013
Corpus ID: 37269181
The task of delay management is to decide whether connecting trains should wait for delayed feeder trains or depart on time in…
Expand
2010
2010
On a game theoretic approach to capacity maximization in wireless networks
E. Ásgeirsson
,
Pradipta Mitra
Proceedings IEEE INFOCOM
2010
Corpus ID: 16886221
We consider the capacity problem (or, the single slot scheduling problem) in wireless networks. Our goal is to maximize the…
Expand
2010
2010
Algorithmic Aspects of Communications in Multihop Wireless Networks with MIMO Links
B. Mumey
,
Jian Tang
,
Timothy Hahn
IEEE International Conference on Communications
2010
Corpus ID: 10072212
MIMO links enable concurrent transmissions of multiple independent data streams between a pair of nodes, which can significantly…
Expand
2008
2008
Joint Stream Control and Scheduling in Multihop Wireless Networks with MIMO Links
B. Mumey
,
Jian Tang
,
Timothy Hahn
IEEE International Conference on Communications
2008
Corpus ID: 15965102
MIMO links can significantly improve network throughput by supporting multiple concurrent data streams between a pair of nodes…
Expand
2007
2007
Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably
Li Gao
,
G. Malewicz
Theory of Computing Systems
2007
Corpus ID: 15862118
This paper studies the problem of maximizing the number of correct results of dependent tasks computed unreliably. We consider a…
Expand
Highly Cited
2006
Highly Cited
2006
The Approximability of the Exemplar Breakpoint Distance Problem
Zhixiang Chen
,
B. Fu
,
B. Zhu
Algorithmic Applications in Management
2006
Corpus ID: 455961
In this paper we present the first set of approximation and inapproximability results for the Exemplar Breakpoint Distance…
Expand
2006
2006
Offline Sorting Buffers on Line
R. Khandekar
,
Vinayaka Pandit
International Symposium on Algorithms and…
2006
Corpus ID: 2493683
We consider the offline sorting buffers problem. Input to this problem is a sequence of requests, each specified by a point in a…
Expand
2005
2005
Biochemical and ecological characterization of two peroxidase isoenzymes from the mangrove, Rhizophora mangle
I. Pearse
,
Katy D. Heath
,
J. Cheeseman
2005
Corpus ID: 1086400
This study examines phenolic peroxidase (POX) in Rhizophora mangle L. leaves in order to assess its role in phenolic manipulation…
Expand
2002
2002
On approximating the maximum diameter ratio of graphs
Joze Marincek
,
B. Mohar
Discrete Mathematics
2002
Corpus ID: 7089245
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE