Heuristics for optimum binary search trees and minimum weight triangulation problems
DOI10.1016/0304-3975(89)90134-5zbMATH Open0688.68063OpenAlexW2074341520WikidataQ62037522 ScholiaQ62037522MaRDI QIDQ1263993FDOQ1263993
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
Recommendations
minimum lengthheuristics for triangulation of polygonsoptimum binary search treespartition of polygons
Searching and sorting (68P10) Polytopes and polyhedra (52Bxx) Algorithms in computer science (68W99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal Computer Search Trees and Variable-Length Alphabetical Codes
- Minimal Triangulations of Polygonal Domains
- A New Algorithm for Minimum Cost Binary Trees
- On approximation behavior of the greedy triangulation for convex polygons
- The all nearest-neighbor problem for convex polygons
- Optimal Multi-Way Search Trees
Cited In (9)
- Title not available (Why is that?)
- 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)
