The problem of where to locate p-sinks in a flow network: complexity approach

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E79-A, Issue 9, 1996, Pages 1495-1503

  Watanabe, Kaoru ^a   Tamura, Hiroshi ^a   Sengoku, Masakazu ^a  

^a NIIGATA UNIVERSITY   (Japan)

Author keywords

Flow network; Location problem; Np complete; Optimization problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; TREES (MATHEMATICS);

FLOW NETWORK; LOCATION PROBLEMS;

COMPUTER NETWORKS;

EID: 0030232485     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (9)

1. K. Watanabe, H. Tamura, and M. Sengoku, "Problems of where to locate p-sinks in a flow network," IEICE Trans., V01.J78-A, no.8, pp.938-946, 1995.
2. O. Kariv and S.L. Hakimi, "An algorithmic approach to network location problems. I : The p-centers," SIAM J. Appl. Math., vol.37, no.3, pp.513-538, 1979.
3. O. Kariv and S.L. Hakimi, "An algorithmic approach to network location problems. II : The p-medians," SIAM J. Appl. Math., vol.37, no.3, pp.539-560, 1979.
4. H. Tamura, M. Sengoku, S. Shinoda, and T. Abe, "Location problems on undirected flow networks," IEICE Trans., \ol.E73, no.12, pp.1989-1993, 1990.
5. M.R. Garey and D.S. Johnson, "The rectilinear Steiner tree problem is NP-complete," SIAM J. vol.32, pp.826-834, 1977
6. M.R. Garey and D.S. Johnson, "Computers and Intractability : A Guide to the Theory of NP-completeness," Freeman, San Francisco, 1979.
7. A.V. Goldberg and R.E. Tarjan, "A new approach to the maximum flow problem," Proc. the 18th Annual ACM Symposium on Theory of Computing, pp.136-146, 1986.
8. R.A. Ahuja, T.L. Magnanti, and J.B. Orlin, "Network Flows," Prentice Hall, 1993.
9. M. Iri, et al., "Graph Theory with Exercises," Corona Publ., 1983.