986 search results - page 73 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
130
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
111
Voted
SOFSEM
1997
Springer
15 years 7 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
122
Voted
WDAG
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
111
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
: Can Grover’s algorithm speed up search of a physical region—for example a 2-D grid of size √ n × √ n? The problem is that √ n time seems to be needed for each query, j...
140
Voted
ESCAPE
2007
Springer
15 years 9 months ago
2007
Springer
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...