Title of article :
Combinatorial Approximation Algorithms for Generalized Flow Problems
Author/Authors :
Jeffrey D. Oldham، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Pages :
35
From page :
135
To page :
169
Keywords :
, generalized minimum-cost flow , restricted uncapacitated transshipment problem , generalized shortest paths , generalized maximum flow , generalized multicommodity flow , generalized concurrent flow , Parametric search , Dynamic Programming , Bellman–Ford–Moore
Journal title :
Journal of Algorithms
Serial Year :
2001
Journal title :
Journal of Algorithms
Record number :
291442
Link To Document :
بازگشت