In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...