101 search results - page 3 / 21 » Domination Problems in Nowhere-Dense Classes |
COLOGNETWENTE
2007
13 years 8 months ago
2007
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...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
JMIV
2006
13 years 7 months ago
2006
Vector field segmentation methods usually belong to either of three classes: methods which segment regions homogeneous in direction and/or norm, methods which detect discontinuiti...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...