On an efficient dynamic programming technique of F. F. Yao

DOI10.1016/0196-6774(89)90003-5zbMath0691.90093OpenAlexW2008594195MaRDI QIDQ3033588

Michelle L. Wachs

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0196-6774(89)90003-5

zbMATH Keywords

optimal binary search treesquadrangle inequalities on cost functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Dynamic programming (90C39)

Related Items (5)

Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries ⋮ Operations research applications of dichotomous search ⋮ Dynamic programming with convexity, concavity and sparsity ⋮ A strategy for searching with different access costs. ⋮ Monotonicity and efficient computation of optimal dichotomous search

This page was built for publication: On an efficient dynamic programming technique of F. F. Yao