32 search results - page 5 / 7 » Branch and Recharge: Exact Algorithms for Generalized Domina... |
TAMC
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
STOC
2003
ACM
15 years 12 months ago
2003
ACM
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
118
click to vote
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
117
Voted
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
93
Voted
ESA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...