Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
Hang DinhAlexander RussellPublished in: CoRR (2008)
Keyphrases
- lower bound
- upper bound
- undirected graph
- optimal solution
- attributed graphs
- directed graph
- branch and bound algorithm
- labeled graphs
- randomized algorithms
- search algorithm
- randomized algorithm
- hamiltonian cycle
- genetic algorithm
- branch and bound
- objective function
- graph matching
- maximum cardinality
- np hard
- worst case
- lower and upper bounds
- global search
- vertex set
- search space
- graph clustering
- minimum weight
- quantum computing
- bipartite graph
- spanning tree
- memetic algorithm
- quantum computation
- quadratic assignment problem
- average degree
- graph databases
- tabu search
- graph theory
- stochastic local search
- edge weights