Multiple cover problem on undirected flow networks

Problems concerning the optimum location of various devices installed in transport, communication, and other types of networks relate to the so-called location on network problems. In this paper, we show how an expanded multiple cover problem can be solved in polynomial time for the case of an undirected flow network, which is a special case of the location problem on flow networks. Up to now, such problems were solved in polynomial time for conditions when values of the flow to each vertex were set above a certain constant magnitude. Here, we show the possibility of solving these problems by a simple algorithm even in cases where these magnitudes are different for each vertex. (C) 2000 Scripts Technica.