✦ LIBER ✦

The dynamic predicate stashing copy problem and the Steiner problem in graphs

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

Book ID: 108445584
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 253 KB
Volume: 125
Category: Article
ISSN: 0377-2217
DOI: 10.1016/s0377-2217(99)00223-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The dynamic predicate stashing copy prob

The dynamic predicate stashing copy problem

✍ Brunilde Sansó; François Soumis 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 840 KB

The steiner problem in graphs

✍ S. E. Dreyfus; R. A. Wagner 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 567 KB

A heuristic for the Steiner problem in g

A heuristic for the Steiner problem in graphs

✍ B. N. Khoury; P. M. Pardalos 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 482 KB

An algorithm for the steiner problem in

An algorithm for the steiner problem in graphs

✍ M. L. Shore; L. R. Foulds; P. B. Gibbons 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 528 KB

An algorithm for the steiner problem in

An algorithm for the steiner problem in graphs

✍ J. E. Beasley 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 579 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