Locating Sources to Meet Flow Demands in Undirected Networks
暂无分享,去创建一个
Kazuhisa Makino | Satoru Iwata | Satoru Fujishige | Kouji Arata | S. Fujishige | S. Iwata | K. Makino | Kouji Arata
[1] Hidetaka Ito,et al. A Faster and Flexible Algorithm for a Location Problem on Undirected Flow Networks , 2000 .
[2] Mechthild Stoer,et al. A simple min-cut algorithm , 1997, JACM.
[3] Toshihide Ibaraki,et al. Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs , 1997, J. Comb. Optim..
[4] Andrew V. Goldberg,et al. Flows in Undirected Unit Capacity Networks , 1999, SIAM J. Discret. Math..
[5] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[6] Roland Backhouse,et al. Pair Algebras and Galois Connections , 1998, Inf. Process. Lett..
[7] Masakazu Sengoku,et al. Some Covering Problems in Location Theory on Flow Networks , 1991 .
[8] Toshihide Ibaraki,et al. A Note on Minimizing Submodular Functions , 1998, Inf. Process. Lett..
[9] Masakazu Sengoku,et al. On a Generalization of a Covering Problem Called Single Cover on Undirected Flow Networks (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems) , 1997 .
[10] Andrew V. Goldberg,et al. Beyond the flow decomposition barrier , 1998, JACM.
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Toshihide Ibaraki,et al. Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..