Improved approximation bounds for edge dominating set in dense graphs.
Jean CardinalStefan LangermanEythan LevyPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- dominating set
- connected dominating set
- facility location problem
- error bounds
- weighted graph
- approximation algorithms
- error tolerance
- undirected graph
- densely connected
- lower bound
- stage stochastic programs
- approximation methods
- edge detection
- upper bound
- graphical models
- np complete
- neural network
- worst case
- approximation guarantees