Matrix Chain Multiplication and Polygon Triangulation Revisited and Generalized
share
The matrix-chain multiplication problem is a classic problem that is widely taught to illustrate dynamic programming. The textbook solution runs in θ(n^3) time. However, there is a complex O(n log n)-time method <cit.>, based on triangulating convex polygons, and a description without proofs or implementation detail, of a much simpler O(n^2)-time method <cit.>. There is also a linear-time approximation algorithm with a small worst-case error bound <cit.>. In this paper, we make five contributions both to theory and pedagogy: 1) We simplify the approach in <cit.>, and provide complete, correct proofs and implementation details, to establish the O(n^2)-time bound. We believe that this exposition is simple enough for classroom use. 2) We extend the O(n^2)-time bound to a natural class of polygon-triangulation problems that generalizes the original polygon-triangulation problem in <cit.>. 3) We show that the worst-case running time of the method in <cit.>, and of our version, is Θ(n^2). 4) We show that in a natural variant of the original polygon-triangulation problem, the approximation method of <cit.> does not achieve the same error bound, but does achieve an error bound about twice the original bound. 5) We detail empirical testing, showing that on random data our variant runs in Θ(n log n) time, while the approach in <cit.> empirically takes Θ(n^2) time. Software for these tests is posted on the web.
READ FULL TEXT
