3874 search results - page 499 / 775 » Approximation Algorithms for k-hurdle Problems |
156
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
137
Voted
PSB
2004
15 years 6 months ago
2004
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
153
click to vote
SIGECOM
2003
ACM
15 years 10 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
146
Voted
LATIN
2010
Springer
15 years 3 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
146
Voted
WIDM
2006
ACM
15 years 11 months ago
2006
ACM
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...