Approximation Algorithms for NP-Complete Problems on Planar Graphs.
Brenda S. BakerPublished in: J. ACM (1994)
Keyphrases
- np complete problems
- approximation algorithms
- max cut
- planar graphs
- vertex cover
- np complete
- np hard
- graph coloring
- undirected graph
- phase transition
- special case
- hard problems
- worst case
- minimum cost
- computational complexity
- decision problems
- randomly generated
- sat problem
- satisfiability problem
- primal dual
- linear programming
- optimal solution
- approximate inference
- constraint satisfaction problems
- scheduling problem
- lower bound
- integer programming
- combinatorial problems
- evolutionary algorithm