Some asymptotically optimal one-sided embeddings of trees of similar formulas into rectangular lattices

DOI10.3103/S0278641917020054MaRDI QIDQ682220zbMATH OpenOpenAlexFDO

Authors Juan-Miguel Gracia

Publication date 14 February 2018

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s0278641917020054

zbMATH Keywords

embedding of treesoptimization according to heightrectangular latticessimilar formulas

Mathematics Subject Classification ID

Discrete approximations in optimal control (49M25) Numerical optimization and variational techniques (65K10)

Review text

The authors consider the problem of optimally placing trees of formulas in rectangular lattices. They construct and study two types of these trees and corresponding ways of placing (embedding) them into such lattices.

Recommendations

• On some optimal embeddings of binary and ternary trees in planar rectangular lattices
• Optimal two-sided embeddings of complete binary trees in rectangular grids
• scientific article; zbMATH DE number 4031713
• How to fit a tree in a box
• How to fit a tree in a box

Cites work

• On some optimal embeddings of binary and ternary trees in planar rectangular lattices

Cited in

(2)

• Optimal two-sided embeddings of complete binary trees in rectangular grids
• Some near-optimal embeddings of full binary and ternary trees in rectangular lattices of minimal length

This page was built for publication: Some asymptotically optimal one-sided embeddings of trees of similar formulas into rectangular lattices

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