Heuristics for optimum binary search trees and minimum weight triangulation problems

DOI10.1016/0304-3975(89)90134-5zbMath0688.68063OpenAlexW2074341520WikidataQ62037522 ScholiaQ62037522MaRDI QIDQ1263993

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) Algorithms in computer science (68W99) Polytopes and polyhedra (52Bxx)

Related Items (5)

ANALOG PARALLEL ALGORITHMS FOR COMPUTATIONAL GEOMETRY ⋮ Optimal binary search trees with costs depending on the access paths. ⋮ Fast algorithms for greedy triangulation ⋮ Optimal binary search trees ⋮ Fast algorithms for greedy triangulation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On approximation behavior of the greedy triangulation for convex polygons
• The all nearest-neighbor problem for convex polygons
• Minimal Triangulations of Polygonal Domains
• Optimal Multi-Way Search Trees
• A New Algorithm for Minimum Cost Binary Trees
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes

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