Skip to main content

Erratum: Cycles in Generalized Networks

  • Conference paper
Graph-Theoretic Concepts in Computer Science (WG 2003)

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

Included in the following conference series:

  • 637 Accesses

Abstract

The paper “Cycles in generalized networks” [2], which appeared in WG 2002, claims that the single source generalized shortest path problem SGSP can be solved in O(nm log n). This is incorrect. The fastest known algorithms take O(n 2 m log n) time. Below we briefly describe the problem and discuss which of our results hold.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall, Englewood Cliffs (1993)

    Google Scholar 

  2. Brandenburg, F.J.: Cycles in generalized networks. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 47–56. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Oldham, J.D.: Combinatorial approximation algorithms for generalized flow problems. J. Algorithms 38, 135–168 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brandenburg, F.J. (2003). Erratum: Cycles in Generalized Networks. In: Bodlaender, H.L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2003. Lecture Notes in Computer Science, vol 2880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39890-5_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39890-5_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20452-7

  • Online ISBN: 978-3-540-39890-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics