… The Push Tree problem deals with the trade-offs betw een the push and pull mechanisms
used in in… can be learned from the static and deterministic Push Tree problem for more realistic …

… second step may be performed easily, thus the idea is to use the routing tree as a (semi-) …
inside the routing tree. In this paper, we study the robustness of a routing tree when the …

… the problem of designing a self-adjusting tree network which serves single-source, multi-destination
communication. The problem … algorithms for this problem, one randomized and one …

… treat the children of each node like a stack, and we modify a tree by popping and pushing …
Their algorithm used a string-based representation, and answered an open problem posed by …

… intersects the push sets of all its sources of interest. We study the problem of choosing push
sets and … For a given multicast tree T, we define the function cost(T) as the sum of the costs of …

… We formalize the problem in section 2, and describe the existing constraint properties in
section 3. … After that, we can push the constraint into the pattern-tree. So, following function …

… consider the problem of designing a self-adjusting tree network which serves single-source,
multi-destination communication. The problem … The Self-adjusting Complete Tree Problem …

… of problems, which we suggest to call general push–pull models, has not as yet received
the attention they deserve in view of the … 2-MP(B): For the 2-median problem on a tree with n …

… tree involving the source and the request nodes. It is clear that under these assumptions …
problem reduces to the well-known Steiner tree problem. Though being NP-hard, the problem …

… This paper considers the distributed learning problem where a group of agents … we introduce
the B-ary Tree Push-Pull algorithm and present its main convergence results. The sketch of …