NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs.
Harry B. Hunt IIIMadhav V. MaratheVenkatesh RadhakrishnanS. S. RaviDaniel J. RosenkrantzRichard Edwin StearnsPublished in: J. Algorithms (1998)
Keyphrases
- hard problems
- approximation schemes
- subgraph isomorphism
- approximation algorithms
- mazurkiewicz traces
- phase transition
- np hard
- temporal logic
- graph matching
- numerical methods
- computational complexity
- hyper heuristics
- graph mining
- neural network
- np complete
- bin packing
- graph databases
- constraint satisfaction problems
- error metrics
- image processing