๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithm for the solution of difference problems by graphs

โœ Scribed by I.V. Fryazinov


Publisher
Elsevier Science
Year
1970
Weight
267 KB
Volume
10
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An SST-based algorithm for the steiner p
โœ J. E. Beasley ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 644 KB

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. We present a formulation of the problem as a shortest spanning tree (SST) problem with additional constraints. By relaxing these addition