Phase Transitions for Greedy Sparse Approximation Algorithms
Jeffrey D. BlanchardCoralia CartisJared TannerAndrew ThompsonPublished in: CoRR (2010)
Keyphrases
- approximation algorithms
- phase transition
- np hard
- np complete
- special case
- constraint satisfaction
- random constraint satisfaction problems
- worst case
- satisfiability problem
- hard problems
- greedy algorithm
- vertex cover
- randomly generated
- combinatorial problems
- minimum cost
- greedy heuristic
- constant factor
- random instances
- set cover
- graph coloring
- approximation ratio
- search algorithm
- sat problem
- primal dual
- cellular automata
- np complete problems
- randomized algorithms
- lower bound
- undirected graph
- greedy algorithms
- tabu search
- dynamic programming
- evolutionary algorithm
- polynomial time approximation
- open shop
- constant factor approximation
- learning algorithm