Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes

  • Conference paper
  • First Online:
Computer Science -- Theory and Applications (CSR 2015)

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

Included in the following conference series:

  • 447 Accesses

Abstract

We consider an undirected multi(commodity)flow demand problem in which a supply graph is planar, each source-sink pair is located on one of three specified faces of the graph, and the capacities and demands are integer-valued and Eulerian. It is known that such a problem has a solution if the cut and (2,3)-metric conditions hold, and that the solvability implies the existence of an integer solution. We develop a purely combinatorial strongly polynomial solution algorithm.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 EPUB and 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

Similar content being viewed by others

References

  1. Frank, A.: Edge-disjoint paths in planar graphs. J. Comb. Theor. Ser. B 39, 164–178 (1985)

    Article  MATH  Google Scholar 

  2. Karzanov, A.V.: Half-integral five-terminus flows. Discrete Appl. Math. 18(3), 263–278 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Karzanov, A.V.: Paths and metrics in a planar graph with three or more holes, Part I: metrics. J. Comb. Theor. Ser. B 60, 1–18 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  4. Karzanov, A.V.: Paths and metrics in a planar graph with three or more holes, Part II: paths. J. Comb. Theor. Ser. B 60, 19–35 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  5. Karzanov, A.V.: Half-integral flows in a planar graph with four holes. Discrete Appl. Math. 56(2–3), 267–295 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Karzanov, A.V.: A combinatorial algorithm for the minimum (2, r)-metric problem and some generalizations. Combinatorica 18(4), 549–568 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  7. Okamura, H.: Multicommodity flows in graphs. Discrete Appl. Math. 6, 55–62 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  8. Okamura, H., Seymour, P.D.: Multicommodity flows in planar graphs. J. Comb. Theor. Ser. B 31, 75–81 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  9. Schrijver, A.: Combinatorial Optimization. Algorithms and Combinatorics, vol. 24. Springer, Heidelberg (2003)

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Higher School of Economics, 20, Myasnitskaya, 101000, Moscow, Russia

    Maxim A. Babenko

  2. Institute for System Analysis of the RAS, 9, Prospect 60 Let Oktyabrya, 117312, Moscow, Russia

    Alexander V. Karzanov

Authors
  1. Maxim A. Babenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander V. Karzanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander V. Karzanov .

Editor information

Editors and Affiliations

  1. Steklov Mathematical Institute of Russian Academy of Sciences, Lomonosov Moscow State University and National Research University Higher School of Economics, Moscow, Russia

    Lev D. Beklemishev

  2. Moscow Institute of Physics and Technology, Moscow, Russia and Kazan (Volga Region) Federal University, Kazan, Kabardino-Balkar.Rep, Russia

    Daniil V. Musatov

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Babenko, M.A., Karzanov, A.V. (2015). A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes. In: Beklemishev, L., Musatov, D. (eds) Computer Science -- Theory and Applications. CSR 2015. Lecture Notes in Computer Science(), vol 9139. Springer, Cham. https://doi.org/10.1007/978-3-319-20297-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20297-6_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20296-9

  • Online ISBN: 978-3-319-20297-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation