287 search results - page 6 / 58 » Constant Factor Approximations for the Hotlink Assignment Pr... |
134
Voted
ALGORITHMICA
2011
14 years 6 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
102
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
116
click to vote
OL
2010
14 years 6 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
Orthogonal Variable Spreading Factor (OVSF) CDMA code has the ability to support higher and variable data rates with a single code using one transceiver. A number of CDMA code ass...
110
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...