Capacitated Domination: Constant Factor Approximation for Planar Graphs
Mong-Jen KaoD. T. LeePublished in: CoRR (2011)
Keyphrases
- planar graphs
- constant factor approximation
- np hard
- approximation algorithms
- undirected graph
- minimum weight
- greedy heuristic
- special case
- lower bound
- linear programming
- minimum cost
- binary variables
- worst case
- vehicle routing problem
- np complete
- optimal solution
- integer programming
- lot sizing
- scheduling problem
- routing problem
- approximate inference
- linear program
- knapsack problem
- graphical models
- computational complexity
- belief propagation
- conditional random fields
- data points
- closest string