Combinatorial Approximation Algorithms f
โ
Jeffrey D Oldham
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 226 KB
Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier ยต v w for each arc v w . For every unit of flow entering the arc, ยต v w units of flow exit. We present a strongly polynomial algorithm for a single-source generalized shortest paths problem, usi