The local Steiner problem in normed planes
β Scribed by Konrad J. Swanepoel
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 174 KB
- Volume
- 36
- 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
Dedicated to Professor George C. Hsiao on the occasion of his 60th birthday
Taxol enhanced assembly and stability of microtubules in the mitotic apparatus and subsequently inhibited chromosome movement and cleavage when injected in the sea urchin egg as reported previously [Y. Hamaguchi et al., 1987: Cell Struct. Funct. 12:43-52]. In this study, to examine the local effect