Reducing the Steiner problem in four uniform orientations
β Scribed by Guo-Hui Lin; Guoliang Xue
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 315 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum-weighted subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe a tabu search algorithm for the Steiner problem in graphs, based o
In this paper, we consider the Steiner problem in graphs, which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph with nonnegative edge costs. We use the formulation of this problem as a shortest spanning tree (SST) problem with additional constraint
As a metaheuristic to obtain solutions of enhanced quality, we formulate the so-called pilot method. It is a tempered greedy method that is to avoid the greedy trap by looking ahead for each possible choice (memorizing the best result). Repeatedly, a so-called master solution is modified, each time