Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...