Tight Lower Bounds for Minimum Weight-Triangulation Heuristics.
Christos LevcopoulosDrago KrznaricPublished in: Inf. Process. Lett. (1996)
Keyphrases
- lower bound
- minimum weight
- greedy heuristic
- np hard
- upper bound
- randomized algorithm
- optimal solution
- branch and bound algorithm
- worst case
- branch and bound
- bipartite graph
- maximum cardinality
- objective function
- spanning tree
- greedy algorithm
- genetic algorithm
- scheduling problem
- vc dimension
- query processing
- families of valid inequalities