Approximating edge dominating set in dense graphs.

Richard Schmied Claus Viehmann

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

Keyphrases

dominating set
connected dominating set
facility location problem
weighted graph
densely connected
edge information
undirected graph
edge detection
approximation algorithms
graph mining
scheduling problem
optimization problems
edge detector
graph matching
facility location
vertex set