Question: Apply greedy algorithm to the problem of the minimum length triangulation of a convex polygon. How far can greedy be away from optimum? Show the
Apply greedy algorithm to the problem of the minimum length triangulation of a convex polygon.
How far can greedy be away from optimum? Show the worst case for a pentagon
Whoever finds the largest ratio between greedy and the optimum will get extra credit
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
