We consider a generalization of the classical minimum spanning tree problem called the generalized minimum spanning tree problem and denoted by GMST problem. It is known that the GMST problem belongs ...

We propose a subgroup identification approach for inferring optimal and interpretable personalized treatment rules with high-dimensional covariates. Our approach is based on a two-step greedy tree ...

An algorithm that runs in network bridges and switches to prevent loops, in which packets keep going around in circles. In a small network with one or two switches, the spanning tree protocol (STP ...