Optimal binary trees with order constraints

DOI10.1016/S0166-218X(98)00138-3zbMath0920.05020OpenAlexW2116505441WikidataQ127363110 ScholiaQ127363110MaRDI QIDQ1283811

András Sebő, Z. Waksman

Publication date: 30 March 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00138-3

zbMATH Keywords

algorithmbinary treeoptimal decomposition

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• On an optimization problem with nested constraints
• A linear-time algorithm for a special case of disjoint set union
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Applications of Path Compression on Balanced Trees
• A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• A Method for the Construction of Minimum-Redundancy Codes
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes