𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reduction tests for the steiner problem in grapsh

✍ Scribed by C. W. Duin; A. Volgenant


Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
888 KB
Volume
19
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The steiner problem in graphs
✍ S. E. Dreyfus; R. A. Wagner πŸ“‚ Article πŸ“… 1971 πŸ› John Wiley and Sons 🌐 English βš– 567 KB
Tabu search for the Steiner problem in g
✍ 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