Wirelength of hypercubes into certain trees

A lot of research has been devoted to finding efficient embedding of trees into hypercubes. On the other hand, in this paper, we consider the problem of embedding hypercubes into kk-rooted complete binary trees, kk-rooted sibling trees, binomial trees and certain classes of caterpillars to minimize the wirelength.