3874 search results - page 223 / 775 » Approximation Algorithms for k-hurdle Problems |
178
click to vote
FAW
2010
Springer
15 years 4 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
135
click to vote
IPL
2008
15 years 4 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
141
click to vote
SIGMOD
2008
ACM
15 years 4 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
161
click to vote
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
137
click to vote
PODS
2004
ACM
16 years 4 months ago
2004
ACM
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...