Heuristics for optimum binary search trees and minimum weight triangulation problems

Authors:
Christos Levcopoulos;Andrzej Lingas;Jörg-R. Sack
Affiliations:
Linko¨ping Univ., Linko¨ping, Sweden;Linko¨ping Univ., Linko¨ping, Sweden;Carleton Univ., Ottawa, Canada
Venue:
Theoretical Computer Science
Year:
1989

Implementations of the LMT heuristic for minimum weight triangulation

Proceedings of the fourteenth annual symposium on Computational geometry
A near-optimal heuristic for minimum weight triangulation of convex polygons

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Optimal binary search trees with costs depending on the access paths

Theoretical Computer Science
Efficient decision tree construction for mining time-varying data streams

CASCON '09 Proceedings of the 2009 Conference of the Center for Advanced Studies on Collaborative Research

Hi-index	5.23