Tight approximation bounds for dominating set on graphs of bounded arboricity.
Nikhil BansalSeeun William UmbohPublished in: Inf. Process. Lett. (2017)
Keyphrases
- dominating set
- connected dominating set
- facility location problem
- approximation algorithms
- worst case
- lower bound
- upper bound
- error bounds
- approximation guarantees
- approximation methods
- generalization error bounds
- constant factor
- np hard
- stage stochastic programs
- continuous functions
- lower and upper bounds
- loss bounds
- asymptotically optimal
- error tolerance
- facility location
- bounded treewidth
- branch and bound
- vc dimension
- randomized algorithm
- np complete
- dynamic programming
- neural network
- weighted graph
- directed graph
- graphical models
- optimal solution