Using Separators Instead of Dynamic Programming in Approximation Algorithms for Planar Graphs.
Fang WanGregory E. ShannonPublished in: ICPP (3) (1991)
Keyphrases
- planar graphs
- vertex cover
- approximation algorithms
- dynamic programming
- undirected graph
- special case
- worst case
- np hard
- minimum cost
- greedy algorithm
- linear programming
- minimum weight
- primal dual
- piecewise linear
- stereo matching
- optimal policy
- knapsack problem
- lower bound
- precedence constraints
- approximate inference
- single machine
- bipartite graph
- graphical models
- polynomial time approximation
- linear program