Skip to main content
SpringerLink
Log in

Maximum k-Splittable s,t-Flows

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

Given a graph with a source and a sink node, the NP-hard maximum k-splittable s,t-flow (M k SF) problem is to find a flow of maximum value from s to t with a flow decomposition using at most k paths. The multicommodity variant of this problem is a natural generalization of disjoint paths and unsplittable flow problems.

Constructing a k-splittable flow requires two interdepending decisions. One has to decide on k paths (routing) and on the flow values for the paths (packing). We give efficient algorithms for computing exact and approximate solutions by decoupling the two decisions into a first packing step and a second routing step. Usually the routing is considered before the packing. Our main contributions are as follows:

(i) We show that for constant k a polynomial number of packing alternatives containing at least one packing used by an optimal M k SF solution can be constructed in polynomial time. If k is part of the input, we obtain a slightly weaker result. In this case we can guarantee that, for any fixed ε>0, the computed set of alternatives contains a packing used by a (1−ε)-approximate solution. The latter result is based on the observation that (1−ε)-approximate flows only require constantly many different flow values. We believe that this observation is of interest in its own right.

(ii) Based on (i), we prove that, for constant k, the M k SF problem can be solved in polynomial time on graphs of bounded treewidth. If k is part of the input, this problem is still NP-hard and we present a polynomial time approximation scheme for it.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

  2. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebr. Discrete Methods 8, 277–284 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308–340 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bagchi, A., Chaudhary, A., Kolman, P.: Short length Menger’s theorem and reliable optical routing. In: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA03), pp. 246–247. ACM, New York (2003)

    Chapter  Google Scholar 

  5. Bagchi, A., Chaudhary, A., Kolman, P., Scheideler, C.: Algorithms for fault-tolerant routing in circuit-switched networks. In: Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 265–274. ACM, New York (2002)

    Google Scholar 

  6. Baier, G.: Flows with path restrictions. Ph.D. thesis, TU Berlin (2003)

  7. Baier, G., Köhler, E., Skutella, M.: On the k-splittable flow problem. Algorithmica 42, 231–248 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Bley, A.: On the complexity of vertex-disjoint length-restricted path problems. Comput. Complex. 12(3–4), 131–149 (2004)

    MathSciNet  Google Scholar 

  9. Bodlaender, H.L.: Dynamic programming on graphs of bounded treewidth. In: Proceedings of the 15th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 317, pp. 105–118. Springer, Berlin (1988)

    Google Scholar 

  10. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305–1317 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  11. Bodlaender, H.L.: Treewidth: Algorithmic techniques and results. In: Privara, I., Ruzicka, P. (eds.) Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 1295, pp. 19–36. Springer, Berlin (1997)

    Google Scholar 

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

    MATH  Google Scholar 

  13. Hagerup, T., Katajainen, J., Nishimura, N., Ragde, P.: Characterizations of k-terminal flow networks and computing network flows in partial k-trees. In: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 641–649 (1995)

  14. Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. Ph.D. thesis, MIT (1996)

  15. Koch, R., Spenke, I.: Complexity and approximability of k-splittable flows. Theor. Comput. Sci. 369, 338–347 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  16. Krysta, P., Sanders, P., Vöcking, B.: Scheduling and traffic allocation for tasks with bounded splittability. In: Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 2747, pp. 500–510. Springer, Berlin (2003)

    Google Scholar 

  17. Martens, M., Skutella, M.: Flows on few paths: Algorithms and lower bounds. In: Albers, S., Radzik, T. (eds.) Algorithms—ESA ’04. Lecture Notes in Computer Science, vol. 3221, pp. 520–531. Springer, Berlin (2004)

    Google Scholar 

  18. Martens, M., Skutella, M.: Length-bounded and dynamic k-splittable flows. In: Proceedings of the International Scientific Annual Conference on Operations Research 2005, pp. 297–302. Springer, Berlin (2006)

    Google Scholar 

  19. Robertson, N., Seymour, P.D.: Graph minors II. Algorithmic aspects of treewidth. J. Algorithms 7, 309–322 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  20. Scheffler, P.: A practical linear time algorithm for disjoint paths in graphs with bounded tree-width. Technical report 396, TU Berlin, Fachbereich 3 Mathematik (1994)

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, Technische Universität Berlin, 10623, Berlin, Germany

    Ronald Koch, Martin Skutella & Ines Spenke

Authors
  1. Ronald Koch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Skutella
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ines Spenke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ronald Koch.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Koch, R., Skutella, M. & Spenke, I. Maximum k-Splittable s,t-Flows. Theory Comput Syst 43, 56–66 (2008). https://doi.org/10.1007/s00224-007-9068-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-007-9068-8

Keywords

Search

Navigation