𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Steiner Problem in Graphs: Topological Methods of Solution

✍ Scribed by A.V. Panyukov

Book ID
111572370
Publisher
SP MAIK Nauka/Interperiodica
Year
2004
Tongue
English
Weight
156 KB
Volume
65
Category
Article
ISSN
0005-1179

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The steiner problem in graphs
The steiner problem in graphs
✍ S. E. Dreyfus; R. A. Wagner πŸ“‚ Article πŸ“… 1971 πŸ› John Wiley and Sons 🌐 English βš– 567 KB
Some generalizations of the steiner prob
Some generalizations of the steiner problem in graphs
✍ C. W. Duin; A. Volgenant πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 562 KB

The Steiner Problem in Graphs (SP) is the problem of finding a set of edges with minimum total weight which connects a given subset of nodes in an edge-weighted (undirected) graph. In the more general Node-weighted Steiner Problem (NSP) also node weights are considered. A restricted minimum spanning

Tabu search for the Steiner problem in g
Tabu search for the Steiner problem in graphs
✍ Celso C. Ribeiro; MaurΓ­cio C. De Souza πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 143 KB πŸ‘ 2 views

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