2023-09-23T17:25:09Z
https://niigata-u.repo.nii.ac.jp/oai
oai:niigata-u.repo.nii.ac.jp:00001931
2022-12-15T03:34:46Z
423:424:425
453:454
Some Covering Problems in Location Theory on Flow Networks
Some Covering Problems in Location Theory on Flow Networks
Tamura, Hiroshi
Sengoku, Masakazu
Shinoda, Shoji
Abe, Takeo
copyrightÂ©1992 IEICE
graphs and networks
flow network
location theory
covering problem
maximum flow
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.
The Institute of Electronics, Information and Communication Engineers
1992-06
eng
journal article
http://hdl.handle.net/10191/6510
https://niigata-u.repo.nii.ac.jp/records/1931
http://www.ieice.org/jpn/trans_online/
AA10826239
09168508
IEICE transactions on fundamentals of electronics, communications and computer sciences
IEICE transactions on fundamentals of electronics, communications and computer sciences
E75-A
6
678
684
https://niigata-u.repo.nii.ac.jp/record/1931/files/e75-a_6_678.pdf
application/pdf
569.9 kB
2019-07-29