Finding minimum-cost flows by double scaling |
| |
Authors: | Ravindra K Ahuja Andrew V Goldberg James B Orlin Robert E Tarjan |
| |
Institution: | (1) Sloan School of Management, M.I.T., 02139 Cambridge, MA, USA;(2) Department of Computer Science, Stanford University, 94305 Stanford, CA, USA;(3) Department of Computer Science, Princeton University, 08544 Princeton, NJ, USA;(4) NEC Research Institute, 08540 Princeton, NJ, USA |
| |
Abstract: | Several researchers have recently developed new techniques that give fast algorithms for the minimum-cost flow problem. In this paper we combine several of these techniques to yield an algorithm running in O(nm(log logU) log(nC)) time on networks withn vertices,m edges, maximum arc capacityU, and maximum arc cost magnitudeC. The major techniques used are the capacity-scaling approach of Edmonds and Karp, the excess-scaling approach of Ahuja and Orlin, the cost-scaling approach of Goldberg and Tarjan, and the dynamic tree data structure of Sleator and Tarjan. For nonsparse graphs with large maximum arc capacity, we obtain a similar but slightly better bound. We also obtain a slightly better bound for the (noncapacitated) transportation problem. In addition, we discuss a capacity-bounding approach to the minimum-cost flow problem.Research partially supported by an NSF Presidential Young Investigator Fellowship, Contract 8451517ECS, and grants from Analog Devices, Apple Computer Inc., and Prime Computer.On leave from Indian Institute of Technology, Kanpur, India.Research partially supported by an NSF Presidential Young Investigator Award.Research at Princeton University partially supported by National Science Foundation Grant DCR-8605962 and Office of Naval Research Contract N00014-87-K-0467. |
| |
Keywords: | Minimum-cost flows transportation problem scaling dynamic trees minimum-cost circulations |
本文献已被 SpringerLink 等数据库收录! |
|