14165 search results - page 186 / 2833 » The generalized two-server problem |
134
click to vote
IPL
2008
15 years 4 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
132
click to vote
EUSFLAT
2001
15 years 5 months ago
2001
A single machine scheduling problem with parameters given in the form of fuzzy numbers is considered. It is assumed that the optimal schedule in such a problem cannot be determine...
134
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
118
click to vote
JCT
2007
15 years 4 months ago
2007
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
135
click to vote
ICDT
2010
ACM
15 years 8 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...