The Minimum Vulnerability Problem

A new approach to the maximum-flow problem

Andrew V. Goldberg, Robert E. Tarjan · Journal of the ACM · 1988 · 1.9K citations · Full text

Computing, Computer Science, Algorithms +16

Beyond the flow decomposition barrier

Andrew V. Goldberg, Satish Rao · Journal of the ACM · 1998 · 474 citations · Full text

Computing, Computer Science, Algorithms +15

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem

Naveen Garg, Goran Konjevod, R. Ravi · Journal of Algorithms · 2000 · 281 citations

Computing, Computer Science, Mathematics +15

Finding minimum-cost flows by double scaling

Ravindra K. Ahuja, Andrew V. Goldberg, James B. Orlin et al. · Mathematical Programming · 1992 · 126 citations · Full text

Natural Sciences, Mathematics, Optimization +11

On network design problems: fixed cost flows and the covering steiner problem

Guy Even, Guy Kortsarz, Wolfgang Slany · ACM Transactions on Algorithms · 2005 · 44 citations

Natural Sciences, Computer Science, Mathematics +17