A Near-Optimal Heuristic for Minimum Weight Triangulation of Convex Polygons (Extended Abstract).
Christos LevcopoulosDrago KrznaricPublished in: SODA (1997)
Keyphrases
- extended abstract
- minimum weight
- greedy heuristic
- minimum spanning tree
- minkowski sum
- convex hull
- digital convexity
- bipartite graph
- randomized algorithm
- greedy algorithm
- spanning tree
- np hard
- maximum cardinality
- weighted graph
- optimal solution
- simulated annealing
- lower bound
- genetic algorithm
- knapsack problem
- combinatorial optimization
- tree patterns
- dynamic programming
- image segmentation