On complexity, representation and approximation of integral multicommodity flows☆
Under an Elsevier user license
open archive
MSC
60C05
60E15
68Q25
90C35
05C85
68R10
Keywords
Derandomization
Integer programming
Integral multicommodity flows
Cited by (0)
- ☆
Parts from Sections 2 and 4 of this paper appeared in preliminary form in the proceedings of the First Annual European Symposium on Algorithms (ESA’93), T. Lengauer (Ed.), Lecture Notes in Computer Science (726), Springer Verlag (1993), pp. 360–372.
Copyright © 2000 Elsevier Science B.V. All rights reserved.