An O(n) algorithm to find a near-optimum partition of a convex polygon

DOI10.1016/0196-6774(81)90014-6zbMATH Open0459.68036OpenAlexW1987507258MaRDI QIDQ3910015FDOQ3910015

Author name not available (Why is that?)

Publication date: 1981

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(81)90014-6

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cited In (3)

• Lower bounds for the matrix chain ordering problem
• Dynamic programming and graph optimization problems
• An optimal parallel algorithm for computing a near-optimal order of matrix multiplications

This page was built for publication: An O(n) algorithm to find a near-optimum partition of a convex polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3910015)