630 search results - page 33 / 126 » Hardness results for approximating the bandwidth |
174
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
165
click to vote
IPSN
2009
Springer
16 years 27 days ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
163
click to vote
FSTTCS
2009
Springer
16 years 20 days ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
149
click to vote
EUROPAR
2010
Springer
15 years 6 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
159
click to vote
IS
2008
15 years 6 months ago
2008
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...