@article{oai:niigata-u.repo.nii.ac.jp:00001931,
 author = {Tamura, Hiroshi and Sengoku, Masakazu and Shinoda, Shoji and Abe, Takeo},
 issue = {6},
 journal = {IEICE transactions on fundamentals of electronics, communications and computer sciences, IEICE transactions on fundamentals of electronics, communications and computer sciences},
 month = {Jun},
 note = {Location theory on networks is concerned with the problem of selecting the best location in a specified network for facilities. Many studies for the theory have been done. However, few studies treat location problems on networks from the standpoint of measuring the closeness between two vertices by the capacity (maximum flow value) between two vertices. This paper concerns location problems, called covering problems on flow networks. We define two types of covering problems on flow networks. We show that covering problems on undirected flow networks and a covering problem on directed flow networks are solved in polynomial times.},
 pages = {678--684},
 title = {Some Covering Problems in Location Theory on Flow Networks},
 volume = {E75-A},
 year = {1992}
}