Improved algorithms for the Steiner problem in networks

A faster approximation algorithm for the Steiner problem in graphs

Kurt Mehlhorn · Information Processing Letters · 1988 · 421 citations

Computing, Computer Science, Mathematics +9

On Implementing the Push—Relabel Method for the Maximum Flow Problem

Boris V. Cherkassky, Andrew V. Goldberg · Algorithmica · 1997 · 372 citations

Computing, Computer Science, Algorithms +9

A dual ascent approach for steiner tree problems on a directed graph

Richard T. Wong · Mathematical Programming · 1984 · 359 citations

Natural Sciences, Computer Science, Mathematics +13

Comparing university departments

J. E. Beasley · Omega · 1990 · 305 citations

Applications of Path Compression on Balanced Trees

Robert E. Tarjan · Journal of the ACM · 1979 · 300 citations · Full text

Computing, Computer Science, Data Mining +6