A New Algorithm forp-Collection Problem on a Tree-Type Flow Network Shuji TSUKIYAMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1998/01/25 Vol. E81-ANo. 1 ;
pp. 139-146 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: flow network, location problem, p-collection problem, dynamic programming,
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1997/03/25 Vol. E80-ANo. 3 ;
pp. 544-550 Type of Manuscript: Special Section PAPER (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems) Category: Keyword: graphs and networks, flow network, location theory, covering problem,
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1996/09/25 Vol. E79-ANo. 9 ;
pp. 1495-1503 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: location problem, flow network, NP-complete, optimization problem,
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1992/06/25 Vol. E75-ANo. 6 ;
pp. 678-684 Type of Manuscript: Special Section PAPER (Special Section of Papers Selected from 1991 Joint Technical Conference on Circuits/Systems, Computers and Communications (JTC-CSCC '91)) Category: Combinational/Numerical/Graphic Algorithms Keyword: graphs and networks, flow network, location theory, covering problem, maximum flow,
