Approximability of the capacitated b-edge dominating set problem.

André Berger Takuro Fukunaga Hiroshi Nagamochi Ojas Parekh

Published in: Theor. Comput. Sci. (2007)

Keyphrases

dominating set
facility location problem
approximation algorithms
facility location
undirected graph
connected dominating set
np hard
network design problem
worst case
special case
edge information
minimum cost
edge detection
network design
single source
routing problem
weighted graph
multi objective
decision making