In this paper we consider spanning tree problems, where n players want to be connected to a source as cheap as possible. We introduce and analyze (n!) vertex oriented construct and charge procedures for such spanning tree situations leading in n steps to a minimum cost spanning tree and a cost...

In this paper, the authors develop a new estimation method that is suitable for censored models with two high-dimensional fixed effects and that is based on a sequence of least squares regressions, yielding significant savings in computing time and hence making it applicable to frameworks in...

The problem of finding the best rank-one approximation to higher-order tensors has extensive engineering and statistical applications. It is well-known that this problem is equivalent to a homogeneous polynomial optimization problem. In this paper, we study theoretical results and numerical...