Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. R. K. Ahuja, T.L. Magnanti and J. B. Orlin, Network flows. Theory, algorithms, and applications Englewood Cliffs, NJ: Prentice Hall, 1993
2. J. Békési, G. Galambos, U. Pferschy and G. J. Woeginger, Greedy algorithms for on-line data compression. J. Algorithms
25, 1997, 274–289.
3. R. E. Bellman, On a routing problem. Quart. Appl. Math.
16, 1985, 87–90.
4. R. E. Burkard and J. Krarup, A linear algorithm for the pos/neg weighted 1-median problem on a cactus. Computing
60, 1998, 193–215.
5. G. B. Dantzig, All shortest routes in a graph. Theory of Graphs (Internat. Sympos., Rome, 1966) New York: Gordon and Breach, 1967, pp. 91–92.