Skip to main content
Springer Nature Link
Log in

Integer plane multiflow maximisation: one-quarter-approximation and gaps

  • Full Length Paper
  • Series A
  • Published:
Mathematical Programming Submit manuscript

Abstract

In this paper, we bound the integrality gap and the approximation ratio for maximum plane multiflow problems and deduce bounds on the flow-multicut-gap. We consider instances where the union of the supply and demand graphs is planar and prove that there exists a multiflow of value at least half the capacity of a minimum multicut. We then show how to convert any multiflow into a half-integer flow of value at least half the original multiflow. Finally, we round any half-integer multiflow into an integer multiflow, losing at most half the value thus providing a 1/4-approximation algorithm and integrality gap for maximum integer multiflows in the plane.

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

Access this article

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

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. A reader familiar with the literature on multiflows with specified demands will note that the flow-cut gap usually refers to the ratio of the sparsest cut to the maximum fraction of demands that can be concurrently routed.

  2. Let \(G=C_4\) (a circuit on 4 vertices) and \(H=2K_2\) (complement of G) so \(G+H=K_4\). The supply edges have capacity 1 and the demands are capped at 1. An integer solution which routes 1 unit of each demand can only route flow half-integrally.

References

  1. Appel, K., Haken, W.: A proof of the four color theorem. Discret. Math. 16, 179–180 (1976)

    Article  MathSciNet  Google Scholar 

  2. Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994). https://doi.org/10.1145/174644.174650

    Article  MathSciNet  MATH  Google Scholar 

  3. Cheriyan, J., Karloff, H., Khandekar, R., Könemann, J.: On the integrality ratio for tree augmentation. Oper. Res. Lett. 36(4), 399–401 (2008)

    Article  MathSciNet  Google Scholar 

  4. Edmonds, J., Giles, R.: A min-max relation for submodular functions in graphs. Ann. Discret. Math. I, 185–204 (1977)

    Article  Google Scholar 

  5. Fiorini, S., Hardy, N., Reed, B., Vetta, A.: Approximate min-max relations for odd cycles in planar graphs. Math. Program. 110(1), 71–91 (1995)

    Article  MathSciNet  Google Scholar 

  6. Frank, A.: Connections in Combinatorial Optimization. Oxford University Press (2011)

  7. Frank, A., Szigeti, Z.: A note on packing paths in planar graphs. Math. Program. 70, 201–209 (1995)

    Article  MathSciNet  Google Scholar 

  8. Garg, N., Kumar, N.: Dual half-integrality for uncrossable cut cover and its application to maximum half-integral flow. In: European Symposium on Algorithms (2020)

  9. Garg, N., Kumar, N., Sebő, A.: Integer plane multiflow maximisation: flow-cut gap and one-quarter-approximation. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 144–157. Springer (2020)

  10. Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi) cut theorems and their applications. SIAM J. Comput. 25(2), 235–251 (1996)

    Article  MathSciNet  Google Scholar 

  11. Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3–20 (1997)

    Article  MathSciNet  Google Scholar 

  12. Hoffman, A.J., Kruskal J.B.: Integral boundary points of convex polyhedra. Linear Inequal. Relat. Syst., 223–246 (1956)

  13. Huang, C.C., Mari, M., Mathieu, C., Schewior, K., Vygen, J.: An approximation algorithm for fully planar edge-disjoint paths. arXiv preprint arXiv:2001.01715 (2020)

  14. Huang, C.C., Mari, M., Mathieu, C., Vygen, J.: Approximating maximum integral multiflows on bounded genus graphs. arXiv preprint arXiv:2005.00575 (2020)

  15. Klein, P., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing, pp. 682–690. ACM (1993)

  16. Klein, P.N., Mathieu, C., Zhou, H.: Correlation clustering and two-edge-connected augmentation for planar graphs. In: 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)

  17. Korach, E., Penn, M.: Tight integral duality gap in the Chinese postman problem. Math. Program. 55, 183–191 (1992)

    Article  MathSciNet  Google Scholar 

  18. Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, vol. 21. Springer, Berlin and Heidelberg, collection Algorithms and Combinatorics, fifth edition (2012)

    Book  Google Scholar 

  19. Král, D., Voss, H.: Edge-disjoint odd cycles in planar graphs. J. Combinat. Theory Ser. B 90, 107–120 (2004)

    Article  MathSciNet  Google Scholar 

  20. Matsumoto, K., Nishizeki, T., Saito, N.: Planar multicommodity fows, maximum matchings and negative cycles. SIAM J. Comput. 15(2), 495–510 (1986)

    Article  MathSciNet  Google Scholar 

  21. Middendorf, M., Pfeiffer, F.: On the complexity of the disjoint paths problem. Combinatorica 13(1), 97–107 (1993)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  23. Robertson, N., Sanders, D.P., Seymour, P., Thomas, R.: Efficiently four-coloring planar graphs. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 571–575 (1996)

  24. Schrijver, A.: Theory of Linear and Integer Programming. Wiley and Chichester (1986)

  25. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer (2003)

  26. Seguin-Charbonneau, L., Shepherd, F.B.: Maximum edge-disjoint paths in planar graphs with congestion 2. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 200–209. IEEE (2011)

  27. Seymour, P.D.: On odd cuts and plane multicommodity flows. Proc. Lond. Math. Soc. 3(1), 178–192 (1981)

    Article  MathSciNet  Google Scholar 

  28. Tardos, É., Vazirani, V.V.: Improved bounds for the max-flow min-multicut ratio for planar and k\_r, r-free graphs. Inf. Process. Lett. 47(2), 77–80 (1993). https://doi.org/10.1016/0020-0190(93)90228-2

  29. Tutte, W.T.: Lectures on matroids. J. Res. Nat. Bureau Stand. B(69) (1965)

  30. Williamson, D.P., Goemans, M.X., Mihail, M., Vazirani, V.V.: A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica 15(3), 435–454 (1995)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

Naveen Garg is the Janaki and K.A.Iyer Chair Professor at IIT Delhi.

Author information

Authors and Affiliations

  1. Indian Institute of Technology Delhi, New Delhi, India

    Naveen Garg

  2. Hasso Plattner Institute, University of Potsdam, Potsdam, Germany

    Nikhil Kumar

  3. CNRS, Laboratoire G-SCOP, University of Grenoble Alpes, Grenoble, France

    András Sebő

Authors
  1. Naveen Garg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nikhil Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. András Sebő
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Naveen Garg.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

A preliminary version of this paper appeared in IPCO 20 [9]

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Garg, N., Kumar, N. & Sebő, A. Integer plane multiflow maximisation: one-quarter-approximation and gaps. Math. Program. 195, 403–419 (2022). https://doi.org/10.1007/s10107-021-01700-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-021-01700-8

Keywords