2024-03-28T16:28:29Z
https://niigata-u.repo.nii.ac.jp/oai
oai:niigata-u.repo.nii.ac.jp:00001903
2022-12-15T03:34:44Z
423:424:425
453:454
Covering Problems in the p-Collection Problems
Covering Problems in the p-Collection Problems
Watanabe, Kaoru
6148
Sengoku, Masakazu
6149
Tamura, Hiroshi
6150
Shinoda, Shoji
5445
location problem
network flows
NP-complete
optimization problem
The lower-bounded p-collection problem is the problem where to locate p sinks in a flow network with lower bounds such that the value of a maximum flow is maximum. This paper discusses the cover problems corresponding to the lower bounded p-collection problem. We consider the complexity of the cover problem, and we show polynomial time algorithms for its subproblems in a network with tree structure.
journal article
The Institute of Electronics, Information and Communication Engineers
1998-03
application/pdf
IEICE transactions on fundamentals of electronics, communications and computer sciences
3
E81-A
470
475
IEICE transactions on fundamentals of electronics, communications and computer sciences
AA10826239
09168508
https://niigata-u.repo.nii.ac.jp/record/1903/files/e81-a_3_470.pdf
eng
http://www.ieice.org/jpn/trans_online/
copyright©1998 IEICE