Optimal sharing |
| |
Authors: | Tetsuo Ichimori Hiroaki Ishii Toshio Nishida |
| |
Affiliation: | (1) Department of Applied Physics, Faculty of Engineering, Osaka University, 565 Suita, Osaka, Japan |
| |
Abstract: | We investigate a sharing method to distribute a given quantity of resources equitably through a capacity-constrained distribution network. The sharing, called an optimal sharing, not only maximizes the minimum share but also minimizes the maximum share. The optimal sharing is obtained in time O(|T| c(n e)) where |T| is the number of sinks in the network andc(n, e) is the time required to solve the maximum flow problem. |
| |
Keywords: | Sharing Maximum Flow Computational Complexity Distribution Network |
本文献已被 SpringerLink 等数据库收录! |
|