Lower Bounds for Combinatorial Problems on Graphs.
Hiroyuki NakayamaTakao NishizekiNobuji SaitoPublished in: J. Algorithms (1985)
Keyphrases
- combinatorial problems
- lower bound
- branch and bound algorithm
- upper bound
- constraint programming
- branch and bound
- metaheuristic
- graph coloring
- constraint satisfaction problems
- combinatorial optimization
- traveling salesman problem
- solving hard
- optimal solution
- constraint satisfaction
- np hard
- randomly generated
- objective function
- combinatorial search
- phase transition
- hard combinatorial optimization problems
- search tree
- global constraints
- graph matching
- graph databases
- graph colouring
- vc dimension
- weighted graph
- worst case
- evolutionary algorithm
- search space
- optimization problems
- sat encodings
- particle swarm optimization
- np complete
- tabu search