A Unified Approach to 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: ESA (1994)
Keyphrases
- hard problems
- approximation schemes
- subgraph isomorphism
- approximation algorithms
- mazurkiewicz traces
- phase transition
- np hard
- np complete
- satisfiability problem
- graph matching
- computational complexity
- temporal logic
- neural network
- weighted graph
- numerical methods
- hyper heuristics
- graph databases
- genetic programming