Sentence examples for tree problem from inspiring English sources

This paper investigates the quota version of the Prize Collecting Steiner Tree Problem (PCSTP) on a graph as a generalization of the well-known Steiner tree problem.

This paper investigates the Prize Collecting Steiner Tree Problem (PCSTP) on a graph, which is a generalization of the well-known Steiner tree problem.

The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree problem (DST), and the set cover problem (SC) which is a subcase of DST.

In this paper, we give MILP formulations for the asymmetric VPN tree problem.

We present a new Lagrangean relaxation for the hop-constrained minimum spanning tree problem (HMST).

This paper proposes a fully dynamic self-stabilizing algorithm for the dynamic Steiner tree problem.

The minimal spanning tree problem is a popular problem of discrete optimization.

We suggest a straightforward polynomial-time algorithm to solve the rotational minimum spanning tree problem.

In this paper, we consider a variant of the well-known Steiner tree problem.

In this paper, we first show that the internal Steiner tree problem is MAX SNP-hard.

We give a randomized algorithm with a polylogarithmic approximation guarantee for the group Steiner tree problem.