Capacitated Domination: Constant Factor Approximations for Planar Graphs.
Mong-Jen KaoD. T. LeePublished in: ISAAC (2011)
Keyphrases
- constant factor
- planar graphs
- partition function
- upper bound
- approximation algorithms
- lower bound
- np hard
- worst case
- sample complexity
- upper and lower bounds
- routing problem
- lot sizing
- undirected graph
- approximate inference
- closed form
- minimum weight
- learning algorithm
- special case
- machine learning
- minimum cost
- weighted graph
- bipartite graph
- belief propagation
- graphical models