Covering trees and lower-bounds on quadratic assignment.
Julian YarkonyCharless C. FowlkesAlexander T. IhlerPublished in: CVPR (2010)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- np hard
- objective function
- decision trees
- lower and upper bounds
- tree structures
- randomly generated problems
- upper and lower bounds
- combinatorial optimization
- worst case
- data structure
- optimal solution
- similarity measure
- database systems
- max sat
- concept class
- quadratic assignment problem
- tree automata
- tree models
- genetic algorithm