๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of the node capacitated in-tree packing problem

โœ Scribed by Shinji Imahori; Yuichiro Miyamoto; Hideki Hashimoto; Yusuke Kobayashi; Mihiro Sasaki; Mutsunori Yagiura

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
234 KB
Volume
59
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A hierarchy of hop-indexed models for th
A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem
โœ Gouveia, Luis; Martins, Pedro ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 143 KB ๐Ÿ‘ 2 views

The Capacitated Minimum Spanning Tree Problem (CMSTP) is to find a minimum spanning tree subject to an additional constraint stating that the number of nodes in each subtree pending from a given root node is not greater than a given number Q. Gouveia and Martins (1996) proposed a hop-indexed flow mo

The distribution of nodes of given degre
The distribution of nodes of given degree in random trees
โœ Drmota, Michael; Gittenberger, Bernhard ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 391 KB ๐Ÿ‘ 2 views

Let T n denote the set of unrooted unlabeled trees of size n and let k โ‰ฅ 1 be given. By assuming that every tree of T n is equally likely, it is shown that the limiting distribution of the number of nodes of degree k is normal with mean value โˆผ ยต k n and variance โˆผ ฯƒ 2 k n with positive constants ยต

On the joint distribution of the nodes i
On the joint distribution of the nodes in uniform multidimensional binary trees
โœ Rainer Kemp ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 313 KB ๐Ÿ‘ 2 views

Multidimensional binary trees represent a symbiosis of trees and tries, and they essentially arise in the construction of search trees for multidimensional keys. The set of nodes in a d-dimensional binary tree can be partitioned into layers according to the nodes appearing in the ith dimension. We d