Locating Sources to Meet Flow Demands in Undirected Networks-Reference-Cited by-同舟云学术

Locating Sources to Meet Flow Demands in Undirected Networks

Published:2000 Issue: Volume: Page:300-313
ISSN:0302-9743
Container-title:Algorithm Theory - SWAT 2000
language:
Short-container-title:

Author:

Arata Kouji,Iwata Satoru,Makino Kazuhisa,Fujishige Satoru

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44985-X_27

Reference11 articles.

1. R. K. Ahuja, T. L. Magnanti and J. B. Orlin: Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, New Jersey, (1993).

2. M. R. Garey and D. S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freedman, New York, (1979).

3. A. V. Goldberg and S. Rao: Beyond the flow decomposition barrier, Journal of the ACM, 45 (1998), 783–797.

4. A. V. Goldberg and S. Rao: Flows in undirected unit capacity networks, SIAM J. Discrete Mathematics, 12 (1999), 1–5.

5. H. Ito, H. Uehara and M. Yokoyama: A faster and flexible algorithm for a location problem on undirected flow networks, IEICE Trans. Fundamentals, E83-A, 2000, to appear.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Sink location to find optimal shelters in evacuation planning;EURO Journal on Computational Optimization;2016-09

2. Static and dynamic source locations in undirected networks;TOP;2015-09-25

3. The Minimum Shift Design Problem: Theory and Practice;Algorithms - ESA 2003;2003

4. Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets;Algorithms and Computation;2000