Heuristics for optimum binary search trees and minimum weight triangulation problems

DOI10.1016/0304-3975(89)90134-5MaRDI QIDQ1263993zbMATH OpenOpenAlexWikidataFDO

Authors Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack

Publication date 1989

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(89)90134-5

zbMATH Keywords

minimum lengthheuristics for triangulation of polygonsoptimum binary search treespartition of polygons

Mathematics Subject Classification ID

Searching and sorting (68P10) Polytopes and polyhedra (52Bxx) Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 4047146
• Optimal binary search trees
• On binary search trees
• scientific article; zbMATH DE number 2011834
• scientific article; zbMATH DE number 1524355

Cites work

• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• A New Algorithm for Minimum Cost Binary Trees
• Minimal Triangulations of Polygonal Domains
• On approximation behavior of the greedy triangulation for convex polygons
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Optimal Multi-Way Search Trees
• The all nearest-neighbor problem for convex polygons

Cited in

(9)

• scientific article; zbMATH DE number 4047146 (Why is no real title available?)
• Fast algorithms for greedy triangulation
• Projection heuristics for binary branchings between sum and product
• ANALOG PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY
• Fast algorithms for greedy triangulation
• LMT-skeleton heuristics for several new classes of optimal triangulations
• A greedy heuristic for a minimum-weight forest problem
• Optimal binary search trees
• Optimal binary search trees with costs depending on the access paths.

This page was built for publication: Heuristics for optimum binary search trees and minimum weight triangulation problems

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