Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Tasks in modern data parallel clusters have highly diverse resource requirements, along CPU, memory, disk and network. Any of… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
An improved coating pan apparatus and spray arm assembly are disclosed for providing facilitated maintenance and cleaning of… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Publishing data for analysis from a table containing personal records, while maintaining individual privacy, is a problem of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Motivated by several applications, we introduce various distance measures between "top k lists." Some of these distance measures… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Four fundamental graph problems, Minimum vertex cover, Maximum independent set, Minimum dominating set and Maximum cut, are shown… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We study clustering under the data stream model of computation where: given a sequence of points, the objective is to maintain a… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
1 Introduction We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We are given a set of points p1, . . . , pn and a symmetric distance matrix (dij) giving the distance between pi and pj . We wish… Expand
Is this relevant?