1054 search results - page 18 / 211 » Capacitated Domination Problem |
MLQ
2007
13 years 7 months ago
2007
We examine the concept of almost everywhere domination from the viewpoint of mass problems. Let AED and MLR be the set of reals which are almost everywhere dominating and Martin-L...
IPL
2008
13 years 7 months ago
2008
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
WADS
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
DM
2002
13 years 7 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...