Keywords
- Short Path
- Span Tree
- Greedy Algorithm
- Minimum Span Tree
- Steiner Tree
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. K. Ahuja, T.L. Magnanti and J. B. Orlin, Network flows. Theory, algorithms, and applications Englewood Cliffs, NJ: Prentice Hall, 1993
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.
R. E. Bellman, On a routing problem. Quart. Appl. Math. 16, 1985, 87–90.
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.
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.
E. W. Dijkstra, A note on two problems in connection with graphs. Numerische Mathematik 1, 1958, 269–271.
G. Ertl, Shortest path calculation in large road networks. Operations Research Spektrum 20, 1998, 15–20.
M.L. Fisher and L.A. Wolsey, On the greedy heuristic for covering and packing problems. SIAM Journal on Algebraic and Discrete Methods 3, 1982, 584–591.
R. W. Floyd, Algorithm 97: Shortest Path. Communication ACM 5, 1962, 345.
M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms. J. of the ACM 34, 1987, 596–615.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman and Co., 1979.
A. V. Goldberg and T. Radzik, A heuristic improvement of the Bellman-Ford algorithm. Appl. Math. Lett. 6, 1993, 3–6.
D. Hunter, An upper bound for the probability of a union. Journal of Aplied Probability 13, 1976, 597–603.
E. F. Moore, The shortest path through a maze. In Proc. of the Int. Symp. on the Theory of Switching, Harvard University Press, 1959, pp. 285–292.
R. Rado, Note on independence functions. Proceedings of the London Mathematical Society 7, 1957, 300–320.
G. Rote, A systolic array algorithm for the algebraic path problem. Computing 34, 1985, 191–219.
P. M. Spira, A new algorithm for finding all shortest paths in a graph of positive arcs in average time O(n 2 log2 n). SIAM J. Comput. 2, 1973, 28–32.
R. E. Tarjan, Data Structures and Network Algorithms. SIAM: Philadelphia, 1983.
E. Uchoa and M. Poggi de Aragão, Vertex-disjoint packing of two Steiner trees: polyhedra and branch-and-cut. In IPCO’ 99, G. Cornuéjols, R. E. Burkard and G. J. Woeginger, eds., Springer Lecture Notes in Computer Science Vol. 1610, pp. 439–452. Berlin, Heidelberg: Springer, 1999.
H. Whitney, On the abstract properties of linear dependence. American Journal of Mathematics 57, 1935, 509–533.
R. J. Worsley, An improved Bonferroni inequality. Biometrika 69, 1982, 297–302.
U. Zimmermann, Linear and Combinatorial Optimization in Ordered Algebraic Structures, Annals of Discrete Mathematics Vol. 10, Amsterdam: North-Holland, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag
About this chapter
Cite this chapter
Burkard, R.E. (2000). Trees and paths: graph optimisation problems with industrial applications. In: Burkard, R.E., et al. Computational Mathematics Driven by Industrial Problems. Lecture Notes in Mathematics, vol 1739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0103916
Download citation
DOI: https://doi.org/10.1007/BFb0103916
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67782-6
Online ISBN: 978-3-540-44976-8
eBook Packages: Springer Book Archive
