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

DOI10.1016/0196-6774(81)90014-6zbMath0459.68036OpenAlexW1987507258MaRDI QIDQ3910015

No author found.

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)

Related Items (3)

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

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