Three algorithms for a minimum cost file transfer problem

This paper deals with the way to transfer copies with some information on a network model with the minimum cost. Under some condition we can get such transfer in O(n/sup 3/) for the vertex number n with the use of a shortest path and a minimum spanning tree. Until now, we only dealt with such static case that all parameters on networks are fixed. Recently we developed an algorithm to apply dynamic vertex costs, while we already have a lazy algorithm for the static case. We compare these three algorithms of the original version, lazy version and dynamic version by simulation.