On heuristics for minimum length rectilinear partitions

DOI10.1007/BF01840380zbMath0689.68048MaRDI QIDQ582084

Yan-Jun Zhang, Ding-Zhu Du

Publication date: 1990

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingElimination Problemmonotonic histogramrectilinear figurerectilinear partitions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Polytopes and polyhedra (52Bxx)

Cites Work

• Optimum binary search trees
• Speed-Up in Dynamic Programming
• Unnamed Item
• Unnamed Item

This page was built for publication: On heuristics for minimum length rectilinear partitions