Skip to main content
SpringerLink
Log in

An Algorithm for Node-Capacitated Ring Routing

  • Conference paper
Algorithms – ESA 2005 (ESA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3669))

Included in the following conference series:

  • 2198 Accesses

Abstract

A strongly polynomial time algorithm is described to solve the node-capacitated routing problem in an undirected ring network.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton Univ. Press, Princeton (1962)

    MATH  Google Scholar 

  2. Frank, A.: Edge-disjoint paths in planar graphs. J. of Combinatorial Theory, Ser. B 2, 164–178 (1985)

    Article  Google Scholar 

  3. Frank, A., Shepherd, B., Tandon, V., Végh, Z.: Node-capacitated ring routing. Mathematics of Operations Research 27(2), 372–383 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Király, Z.: An O(n2) algorithm for ring routing, Egres Technical Reports, TR-2005-10 (2005), see http://www.cs.elte.hu/egres/

  5. Möhring, R.H., Wagner, D.: Combinatorial Topics in VLSI Design. In: Dell’ Amico, M., Maffioli, F.M., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 429–444. John Wiley, Chichester (1997)

    Google Scholar 

  6. Onaga, K., Kakusho, O.: On feasibility conditions of multicommodity flows in Networks. IEEE Trans. Theory 18, 425–429 (1971)

    Article  MathSciNet  Google Scholar 

  7. Okamura, H., Seymour, P.D.: Multicommodity flows in planar graphs. J. Combinatorial Theory, Ser. B 31, 75–81 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ripphausen-Lipa, H., Wagner, D., Weihe, K.: Survey on Efficient Algorithms for Disjoint Paths Problems in Planar Graphs. In: Cook, W., Lovász, L., Seymour, P.D. (eds.) Year of Combinatorial Optimization. DIMACS-Series in Discrete Mathematics and Theoretical Computer Science, vol. 20, pp. 295–354. AMS, Providence (1995)

    Google Scholar 

  9. Schrijver, A., Seymour, P., Winkler, P.: The ring loading problem. SIAM J. Discrete Math. 11(1), 1–14 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Wagner, D., Weihe, K.: A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica 15, 135–150 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Egerváry Research Group of MTA-ELTE, Department of Operations Research, Department of Computer Science, Communication Networks Laboratory, Eötvös University, Pázmány P. s. 1/c., Budapest, H-1117, Hungary

    András Frank, Zoltán Király & Balázs Kotnyek

Authors
  1. András Frank
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zoltán Király
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Balázs Kotnyek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. BRICS, MADALGO, Department of Computer Science, University of Aarhus, Denmark

    Gerth Stølting Brodal

  2. University of Rome “La Sapienza”, Rome, Italy

    Stefano Leonardi

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frank, A., Király, Z., Kotnyek, B. (2005). An Algorithm for Node-Capacitated Ring Routing. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_24

Download citation

  • DOI: https://doi.org/10.1007/11561071_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29118-3

  • Online ISBN: 978-3-540-31951-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation