The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Transforming science findings into practical applications is presented in the specific case of using remote sensing to detect the presence of an infestation of grapevines. The vin...
Various enumeration problems for classes of simply generated families of trees have been the object of investigation in the past. We mention the enumeration of independent subsets,...
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
We study a capacity sizing problem in a service system that is modeled as a single-class queue with multiple servers and where customers may renege while waiting for service. A sa...
Achal Bassamboo, Ramandeep S. Randhawa, Assaf J. Z...