Sciweavers

1054 search results - page 30 / 211
» Capacitated Domination Problem
Sort
View
ESA
2009
Springer
131views Algorithms» more  ESA 2009»
15 years 9 months ago
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
Geevarghese Philip, Venkatesh Raman, Somnath Sikda...
IWPEC
2004
Springer
15 years 7 months ago
On Miniaturized Problems in Parameterized Complexity Theory
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...
Yijia Chen, Jörg Flum
COLOGNETWENTE
2007
15 years 3 months ago
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Johann Hurink, Tim Nieberg
SIAMJO
2002
120views more  SIAMJO 2002»
15 years 2 months ago
Dual Stochastic Dominance and Related Mean-Risk Models
We consider the problem of constructing mean{risk models which are consistent with the second degree stochastic dominance relation. By exploiting duality relations of convex analys...
Wlodzimierz Ogryczak, Andrzej Ruszczynski
IJAR
2008
116views more  IJAR 2008»
15 years 2 months ago
Portfolio management under epistemic uncertainty using stochastic dominance and information-gap theory
Portfolio management in finance is more than a mathematical problem of optimizing performance under risk constraints. A critical factor in practical portfolio problems is severe u...
Daniel Berleant, L. Andrieu, Jean-Philippe Argaud,...