287 search results - page 9 / 58 » Constant Factor Approximations for the Hotlink Assignment Pr... |
SODA
2007
ACM
13 years 10 months ago
2007
ACM
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
TON
2010
13 years 3 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 ...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...