Problems of where to locate p-sinks in a flow network

As location problems in flow networks, there are p‐center and p‐median problems; and they are known to be solvable in polynomial time. In this paper, we propose a new location problem. It is the problem of locating p‐sinks so that the maximum flow is maximized given a flow network N with a source (t...

Full description

Saved in:
Bibliographic Details
Published inElectronics & communications in Japan. Part 3, Fundamental electronic science Vol. 79; no. 2; pp. 12 - 21
Main Authors Watanabe, Kaoru, Sengoku, Masakazu, Tamura, Hiroshi
Format Journal Article
LanguageEnglish
Published New York Wiley Subscription Services, Inc., A Wiley Company 01.02.1996
Subjects
dynamic programming
Flow network
location problem
pseudo-polynomial time algorithm
Online AccessGet full text

Cover

More Information
Summary:As location problems in flow networks, there are p‐center and p‐median problems; and they are known to be solvable in polynomial time. In this paper, we propose a new location problem. It is the problem of locating p‐sinks so that the maximum flow is maximized given a flow network N with a source (this problem is called a p‐collection problem). First, a linear time algorithm to solve the 1‐collection problem for trees is given. Then a pseudo‐polynomial time algorithm to solve the p‐collection problem for trees based on dynamic programming is presented. Since the decision problem corresponding to the p‐collection problem for trees is known to be NP‐complete, its decision problem turns out to be strongly NP‐complete.
Bibliography:ArticleID:ECJC4430790202
istex:D0C4210A71FF5745676856C8EBDD6EE895F21132
ark:/67375/WNG-B0WCHV55-M
Kaoru Watanabe received his B.S. degree in Information Engineering in 1990 and his M.S.degree in 1992, both from Niigata University. Currently, he is in the doctoral program of Graduate School of Science and Technology of the same university. He specializes in graph networks.
Masakazu Sengoku received his B.S. in Electrical Engineering from Niigata University in 1967. In 1972, he received his Ph.D. from Hokkaido University. He then became an Assistant Professor of Electronic Engineering at Hokkaido University. Later, he joined Information Engineering Department of Niigata University as an Associate Professor and is currently a Professor there. His research interest includes circuit theory, graph network theory, and information transmission especially mobile communications. He is a co‐author of Graph 7heory Exercise. He is a recipient of the 1991 I.E.I.C.E. Best Paper Award. He is a member of the IEEE and the Information Processing Society.
Hiroshi Tamura received his B.S. degree in Education in 1982, his M.S.degree in Science in 1986, and his Ph.D. degree in Science in 1990, all from Niigata University. He became an Assistant Professor of the Graduate School of Science and Technology of Niigata University in 1990; and, in 199 1, he became an Associate Professor at the Center for Cooperative Research of Niigata University. Currently, he is an Associate Professor of Niigata Institute of Technology. He has been working in the areas of graph theory and applications and computational geometry and applications. He is a recipient of the 1991 I.E.I.C.E. Best Paper Award.
ISSN:1042-0967
1520-6440
DOI:10.1002/ecjc.4430790202