1760 search results - page 139 / 352 » Connected Set Cover Problem and Its Applications |
IWPEC
2010
Springer
13 years 6 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
KCAP
2009
ACM
14 years 2 months ago
2009
ACM
The extensive work on Knowledge Engineering in the 1990s has resulted in a systematic analysis of task-types, and the corresponding problem solving methods that can be deployed fo...
INFOCOM
1991
IEEE
13 years 11 months ago
1991
IEEE
Although the issues of routing and scheduling in packet radio networks are highly interdependent, few studies have addressed their interactions. In this paper, we address the prob...
APVIS
2007
13 years 9 months ago
2007
We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site ...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—In layered networks, a single failure at a lower layer may cause multiple failures in the upper layers. As a result, traditional schemes that protect against single failures may...