Two-Commodity Flow

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Two-Commodity Flow

Full text

Pdf (1.00 MB)

Source

Journal of the ACM (JACM) archive
Volume 25 , Issue 4 (October 1978) table of contents

Pages: 596 - 611

Year of Publication: 1978

ISSN:0004-5411

Author

Alon Itai

Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 14, Downloads (12 Months): 83, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/322092.322100 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BERGE, C, AND GHOUILA-HOURI, A Programmmg, Games and Transportation Networks, Methuen, London, England, 1965
	2	DINlt, E A Algorithm for solution of a problem of maximum flow m a network with power esumauon Soy Math Dokl 11 (1970), 1277-1280
	3	Jack Edmonds , Richard M. Karp, Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems, Journal of the ACM (JACM), v.19 n.2, p.248-264, April 1972 [doi>10.1145/321694.321699]
	4	EVEN, S, ITAI, A, AND SHAMIR, A On the complexity of timetable and multi-commodity flow problems SIAM J Comptng 5 (1976), 691-703
	5	EVEN, S, AND TARJAN, R E Network flow and testing graph connectivRy SIAM J. Comptng, 4 (1975), 507-518
	6	FORD, L R JR. AND FULKEFtSON, D R Flow~ In Networks Princeton U Press, Princeton, N J, 1962
	7	H u, T C Mulu-commodity network flows J ORSA 11 (1963), 344-360, also m Integer Programming and Network Flows, Addison-Wesley, Reading, Mass, 1969
	8	ITAI, A Multi-commodity flow Ph D Dlss, Femberg Graduate School, Welzmann lnst So, Rehovot, Israel, 1976
	9	KARO, R M Reduobdtty among combinatorial problems In Complexity of Computer Computations, R N Mdler and J W Thatcher. Eds, Plenum Press. New York. 1972, pp 85-104
	10	KARZANOV, A V Determining the maximal flow in a network by the method of preflow Soviet Math Dokl 15 (1974). 434-437
	11	KLEE, V L, AnD MINTY, G J How good is the simplex algorithm In Inequahttes 111, 0 Shisha, Ed, Academic Press. New York, 1972, pp 159-175
	12	Richard E. Ladner, On the Structure of Polynomial Time Reducibility, Journal of the ACM (JACM), v.22 n.1, p.155-171, Jan. 1975 [doi>10.1145/321864.321877]
	13	ZADEH, N A bad network problem for the simplex method and other minimum cost flow algorithms Math Programming 5 (1975). 255-266
	14	Norman Zadeh, Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows, Journal of the ACM (JACM), v.19 n.1, p.184-192, Jan. 1972 [doi>10.1145/321679.321693]

CITED BY 4

	Edith Cohen , Nimrod Megiddo, Algorithms and complexity analysis for some flow problems, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.120-130, January 28-30, 1991, San Francisco, California, United States
	Gruia Calinescu , Cristina G. Fernandes , Bruce Reed, Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width, Journal of Algorithms, v.48 n.2, p.333-359, September 2003
	Antonios Symvonis , Jonathon Tidswell, An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method, IEEE Transactions on Computers, v.45 n.5, p.619-625, May 1996
	Maulin Patel , R. Chandrasekaran , S. Venkatesan, Improved quasi-path restoration in mesh networks, IEEE/ACM Transactions on Networking (TON), v.16 n.1, p.144-156, February 2008