Introduction to algorithms
A fast algorithm for generalized network location problems
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Discrete Mathematics
Proceedings of the 7th annual international conference on Mobile computing and networking
| Hi-index | 0.00 |
Many problems exist related to the location problems of resources in a computer network to accommodate client demands subject to constraints imposed on the clients and the servers. For example, one classical location problem consists of computing the dominating sets (DS) of a network. A DS is a set of nodes in the network (called dominating nodes) such that the remaining nodes in the network are adjacent to at least one dominating node. The problem of finding a DS of minimum cardinality is known to be NP-complete. A variety of conditions may be imposed on the dominating set D in a graph G = (V, E). Among them, we have multiple domination and distance domination. Multiple domination requires that each vertex in V --- D be dominated by at least k vertices in D for a fixed positive integer k. Distance domination requires that each vertex in V --- D be within distance r of at least one vertex in D for a fixed positive integer r. We refer to the problem of computing DS when these two conditions are taken into account as the Generic Dominating Sets (GDS) problem. Prior work on solving the GDS problem focuses on interval graphs (IG), which can represent only a few network topologies. We present the first solutions to the GDS problem for arbitrary graphs. Simulation results regarding several configurations are presented.