Skip to main content
SpringerLink
Log in

Efficient algorithms for path problems with general cost criteria

  • Graph Algorithms (Session 8)
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 510))

Included in the following conference series:

Abstract

Recent applications of path problems in engineering, e.g., in circuit design require the computation of optimal paths with respect to general cost criteria going beyond path length. In this paper we extend the path algorithms by Ford and Dijkstra to handle a wide variety of cost criteria which can be nonassociative, nonmonotonic, partially ordered, and not antisymmetric. Negative cycles are allowed, so our search method is more powerful than best-first search.

In addition we analyze the efficiency of the presented algorithms. The method gives efficient algorithms for a number of applications. We give several examples. Among them are finding paths with minimum frequency of the most frequent edge cost and finding paths with minimum range in edge cost.

Finally, we describe goal-directed versions of our search methods.

Part of this research was supported by the German Secretary for Research and Technology, Grant No. 13AS0097

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Series in Computer Science and Engineering. Addison-Wesley, Reading, MA, 1974.

    Google Scholar 

  2. R. E. Bellman. On a routing problem. Quarterly Applied Mathematics, 16:87–90, 1958.

    Google Scholar 

  3. R. Dechter and J. Pearl. Generalized best-first search strategies and the optimality of a*. Journal of the Association for Computing Machinery, 32(3):505–536, 1985.

    Google Scholar 

  4. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269–271, 1959.

    Google Scholar 

  5. L. R. Ford. Network flow theory. Technical Report P-923, RAND Corp., Santa Monica, CA, 1956.

    Google Scholar 

  6. M. R. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the Association for Computing Machinery, 34(3):596–615, 1987.

    Google Scholar 

  7. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.

    Google Scholar 

  8. M. Hall Jr. Combinatorial Theory. John Wiley & Sons, New York, 1967.

    Google Scholar 

  9. P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Science and Cybernetics, SCC-4(2):100–107, 1968.

    Google Scholar 

  10. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Series in Computer Science. Adds that cison-Wesley, Reading, MA, 1979.

    Google Scholar 

  11. T. C. Hu and M. T. Shing. The alpha-beta routing. In T. C. Hu and E. S. Kuh, editors, VLSI Layout: Theory and Design, pages 139–143. IEEE Press, New York, 1985.

    Google Scholar 

  12. U. Huckenbeck and D. Ruland. A generalized best-first search method in graphs. In R. Möhring, editor, Proceedings of the 16th International Workshop on Graphtheoretic Concepts in Computer Science (WG'90), New York, 1990. Springer Lecture Notes in Computer Science, No. 484, Springer Verlag.

    Google Scholar 

  13. W. John. Remarks to the solution of EMC-Problems on printed circuit boards. In Proceedings of the Seventh International Conference on Electromagnetic Compatibility, York, U.K., 1990.

    Google Scholar 

  14. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Teubner-Wiley Series of Applicable Theory in Computer Science. John Wiley & Sons, New York, 1990.

    Google Scholar 

  15. T. Lengauer and D. Theune. Unstructured path problems and the making of semirings. Typescript, Fachbereich Mathematik-Informatik, Universität Gesamthochschule Paderborn, 1991.

    Google Scholar 

  16. K. Mehlhorn. Data Structures and Algorithms II: Graph Algorithms and NP-completeness, volume 2 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, New York, 1984.

    Google Scholar 

  17. G. Rote. Path problems in graphs. Computing Supplement, 7:155–189, 1990.

    Google Scholar 

  18. U. Zimmermann. Linear and combinatorial optimization in ordered algebraic structures. (Especially chapter 8: Algebraic path problems.) Ann. Discrete Math. 10, 1–380, 1981.

    Google Scholar 

  19. R. E. Tarjan. Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics No. 44. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cadlab and University of Paderborn, Paderborn, West Germany

    T. Lengauer & D. Theune

Authors
  1. T. Lengauer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Theune
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Javier Leach Albert Burkhard Monien Mario Rodríguez Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lengauer, T., Theune, D. (1991). Efficient algorithms for path problems with general cost criteria. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_144

Download citation

  • DOI: https://doi.org/10.1007/3-540-54233-7_144

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54233-9

  • Online ISBN: 978-3-540-47516-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation