5595 search results - page 133 / 1119 » Approximation Algorithms for Clustering Problems |
138
click to vote
TON
2010
14 years 11 months ago
2010
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
173
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
152
click to vote
JASIS
2007
15 years 4 months ago
2007
A distributed memory parallel version of the group average Hierarchical Agglomerative Clustering algorithm is proposed to enable scaling the document clustering problem to large c...
129
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
We show that there is no log log M log log log M -approximation for the undirected congestion minimization problem unless NP ZPTIME(npolylog n ), where M is the size of the grap...
128
Voted
ALGORITHMICA
2005
15 years 4 months ago
2005
Abstract. We consider the problem of approximating a polygonal curve