Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems.
Madhav V. MaratheHarry B. Hunt IIIRichard Edwin StearnsVenkatesh RadhakrishnanPublished in: SIAM J. Comput. (1998)
Keyphrases
- approximation algorithms
- vertex cover
- np hard
- special case
- network design problem
- np complete
- np hardness
- randomized algorithms
- exact algorithms
- approximation schemes
- minimum cost
- search algorithm
- evolutionary algorithm
- worst case
- optimization problems
- disjoint paths
- constant factor
- set cover
- dynamic programming
- computational complexity