✦ LIBER ✦

Parallel local search for Steiner trees in graphs

✍ Scribed by M.G.A. Verhoeven; M.E.M. Severens

Book ID: 110379347
Publisher: Springer US
Year: 1999
Tongue: English
Weight: 242 KB
Volume: 90
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1018908614375

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Parallel Grasp for the Steiner Tree Pr

A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy

✍ S.L. Martins; M.G.C. Resende; C.C. Ribeiro; P.M. Pardalos 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 108 KB

Searching Steiner trees for web graph qu

Searching Steiner trees for web graph query

✍ Wookey Lee; Woong-Kee Loh; Mye M. Sohn 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 585 KB

Local search with perturbations for the

Local search with perturbations for the prize-collecting Steiner tree problem in graphs

✍ S. A. Canuto; M. G. C. Resende; C. C. Ribeiro 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

A PTAS for weight constrained Steiner tr

A PTAS for weight constrained Steiner trees in series–parallel graphs

✍ Guangting Chen; Guoliang Xue 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Series - parallel graphs and depth-first

Series - parallel graphs and depth-first search trees

✍ Syslo, M. 📂 Article 📅 1984 🏛 IEEE ⚖ 615 KB

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