Skip to main content

Trees and paths: graph optimisation problems with industrial applications

  • 760 Accesses

Part of the Lecture Notes in Mathematics book series (LNMCIME,volume 1739)

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

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. K. Ahuja, T.L. Magnanti and J. B. Orlin, Network flows. Theory, algorithms, and applications Englewood Cliffs, NJ: Prentice Hall, 1993

    MATH  Google Scholar 

  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.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. R. E. Bellman, On a routing problem. Quart. Appl. Math. 16, 1985, 87–90.

    MATH  Google Scholar 

  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.

    CrossRef  MathSciNet  MATH  Google Scholar 

  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.

    Google Scholar 

  6. E. W. Dijkstra, A note on two problems in connection with graphs. Numerische Mathematik 1, 1958, 269–271.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. G. Ertl, Shortest path calculation in large road networks. Operations Research Spektrum 20, 1998, 15–20.

    CrossRef  MATH  Google Scholar 

  8. 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.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. R. W. Floyd, Algorithm 97: Shortest Path. Communication ACM 5, 1962, 345.

    CrossRef  Google Scholar 

  10. 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.

    CrossRef  MathSciNet  Google Scholar 

  11. 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.

    MATH  Google Scholar 

  12. A. V. Goldberg and T. Radzik, A heuristic improvement of the Bellman-Ford algorithm. Appl. Math. Lett. 6, 1993, 3–6.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. D. Hunter, An upper bound for the probability of a union. Journal of Aplied Probability 13, 1976, 597–603.

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. 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.

    Google Scholar 

  15. R. Rado, Note on independence functions. Proceedings of the London Mathematical Society 7, 1957, 300–320.

    CrossRef  MathSciNet  MATH  Google Scholar 

  16. G. Rote, A systolic array algorithm for the algebraic path problem. Computing 34, 1985, 191–219.

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. 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.

    CrossRef  MathSciNet  MATH  Google Scholar 

  18. R. E. Tarjan, Data Structures and Network Algorithms. SIAM: Philadelphia, 1983.

    CrossRef  MATH  Google Scholar 

  19. 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.

    Google Scholar 

  20. H. Whitney, On the abstract properties of linear dependence. American Journal of Mathematics 57, 1935, 509–533.

    CrossRef  MathSciNet  MATH  Google Scholar 

  21. R. J. Worsley, An improved Bonferroni inequality. Biometrika 69, 1982, 297–302.

    CrossRef  MathSciNet  MATH  Google Scholar 

  22. U. Zimmermann, Linear and Combinatorial Optimization in Ordered Algebraic Structures, Annals of Discrete Mathematics Vol. 10, Amsterdam: North-Holland, 1981.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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