Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs.
Hang DinhAlexander RussellPublished in: APPROX-RANDOM (2008)
Keyphrases
- lower bound
- upper bound
- undirected graph
- labeled graphs
- directed graph
- attributed graphs
- optimal solution
- randomized algorithms
- randomized algorithm
- hamiltonian cycle
- search algorithm
- branch and bound
- genetic algorithm
- objective function
- combinatorial optimization
- np hard
- graph matching
- worst case
- minimum weight
- lower and upper bounds
- graph theory
- tabu search
- global search
- maximum cardinality
- transitive closure
- branch and bound algorithm
- simulated annealing
- vc dimension
- memetic algorithm
- graph data
- max sat
- graph model
- graph structure
- vertex set
- quantum computing
- quantum inspired
- average degree
- edge weights
- particle swarm optimization algorithm
- weighted graph
- bipartite graph