Document Open Access Logo

Node-Connectivity Terminal Backup, Separately-Capacitated Multiflow, and Discrete Convexity

Authors Hiroshi Hirai , Motoki Ikeda

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2020.65.pdf
  • Filesize: 0.56 MB
  • 19 pages

Document Identifiers

Author Details

Hiroshi Hirai
  • Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo, Japan
Motoki Ikeda
  • Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo, Japan

Funding

  • Hirai, Hiroshi: JSPS KAKENHI Grant Number JP17K00029 and JST PRESTO Grant Number JPMJPR192A, Japan.

Acknowledgements

We thank the referees for helpful comments.

Cite As Get BibTex

Hiroshi Hirai and Motoki Ikeda. Node-Connectivity Terminal Backup, Separately-Capacitated Multiflow, and Discrete Convexity. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 65:1-65:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020) https://doi.org/10.4230/LIPIcs.ICALP.2020.65

Abstract

The terminal backup problems [Anshelevich and Karagiozova, 2011] form a class of network design problems: Given an undirected graph with a requirement on terminals, the goal is to find a minimum cost subgraph satisfying the connectivity requirement. The node-connectivity terminal backup problem requires a terminal to connect other terminals with a number of node-disjoint paths. This problem is not known whether is NP-hard or tractable. Fukunaga (2016) gave a 4/3-approximation algorithm based on LP-rounding scheme using a general LP-solver.
In this paper, we develop a combinatorial algorithm for the relaxed LP to find a half-integral optimal solution in O(mlog (mUA)⋅ MF(kn,m+k²n)) time, where m is the number of edges, k is the number of terminals, A is the maximum edge-cost, U is the maximum edge-capacity, and MF(n',m') is the time complexity of a max-flow algorithm in a network with n' nodes and m' edges. The algorithm implies that the 4/3-approximation algorithm for the node-connectivity terminal backup problem is also efficiently implemented. For the design of algorithm, we explore a connection between the node-connectivity terminal backup problem and a new type of a multiflow, called a separately-capacitated multiflow. We show a min-max theorem which extends Lovász - Cherkassky theorem to the node-capacity setting. Our results build on discrete convex analysis for the node-connectivity terminal backup problem.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Combinatorial optimization
Keywords
  • terminal backup problem
  • node-connectivity
  • separately-capacitated multiflow
  • discrete convex analysis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. E. Anshelevich and A. Karagiozova. Terminal backup, 3D matching, and covering cubic graphs. SIAM J. Comput., 40(3):678-708, 2011. URL: https://doi.org/10.1137/090752699.
  2. A. Bernáth, Y. Kobayashi, and T. Matsuoka. The generalized terminal backup problem. SIAM J. Discrete Math., 29(3):1764-1782, 2015. URL: https://doi.org/10.1137/140972858.
  3. J. Chalopin, V. Chepoi, H. Hirai, and D. Osajda. Weakly modular graphs and nonpositive curvature. To appear in Mem. Amer. Math. Soc. Google Scholar
  4. J. Cheriyan, S. Vempala, and A. Vetta. Network design via iterative rounding of setpair relaxations. Combinatorica, 26(3):255-275, 2006. URL: https://doi.org/10.1007/s00493-006-0016-z.
  5. B. V. Cherkassky. A solution of a problem of multicommodity flows in a network. Ekonomika i Matematicheskie Metody, 13:143-151, 1977. in Russian. Google Scholar
  6. A. E. Feldmann, J. Könemann, K. Pashkovich, and L Sanità. Fast approximation algorithms for the generalized survivable network design problem. In Proceedings of the 27th International Symposium on Algorithms and Computation, pages 33:1-33:12, 2016. URL: https://doi.org/10.4230/LIPIcs.ISAAC.2016.33.
  7. L. Fleischer, K. Jain, and D. P. Williamson. Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. J. Comput. Syst. Sci., 72(5):838-867, 2006. URL: https://doi.org/10.1016/j.jcss.2005.05.006.
  8. T. Fukunaga. Approximating the generalized terminal backup problem via half-integral multiflow relaxation. SIAM J. Discrete Math., 30(2):777-800, 2016. URL: https://doi.org/10.1137/151004288.
  9. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM Journal on Computing, 37(2):630-652, 2007. URL: https://doi.org/10.1137/S0097539704446232.
  10. A. V. Goldberg and A. V. Karzanov. Scaling methods for finding a maximum free multiflow of minimum cost. Math. Oper. Res., 22(1):90-109, 1997. URL: https://doi.org/10.1287/moor.22.1.90.
  11. H. Hirai. Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees. Math. Program. A, 137(1):503-530, 2013. Google Scholar
  12. H. Hirai. L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem. Discrete Optim., 18:1-37, 2015. URL: https://doi.org/10.1016/j.disopt.2015.07.001.
  13. H. Hirai. Discrete convexity and polynomial solvability in minimum 0-extension problems. Math. Program. A, 155(1):1-55, 2016. URL: https://doi.org/10.1007/s10107-014-0824-7.
  14. H. Hirai. A dual descent algorithm for node-capacitated multiflow problems and its applications. ACM Trans. Algorithms, 15(1):15:1-15:24, 2018. URL: https://doi.org/10.1145/3291531.
  15. H. Hirai. L-convexity on graph structures. J. Oper. Res. Soc. Jap., 61(1):71-109, 2018. URL: https://doi.org/10.15807/jorsj.61.71.
  16. H. Hirai and M. Ikeda. A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem, 2019. URL: http://arxiv.org/abs/1909.01599.
  17. Y. Iwata, Y. Yamaguchi, and Y. Yoshida. 0 all CSPs, half-integral A-path packing, and linear-time FPT algorithms. In Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, pages 462-473, 2018. URL: https://doi.org/10.1109/FOCS.2018.00051.
  18. K. Jain. A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica, 21(1):39-60, 2001. URL: https://doi.org/10.1007/s004930170004.
  19. A. V. Karzanov. A minimum cost maximum multiflow problem. In Combinatorial Methods for Flow Problems, pages 138-156. Institute for System Studies, Moscow, 1979. in Russian. Google Scholar
  20. A. V. Karzanov. Minimum cost multiflows in undirected networks. Math. Program., 66(1):313-325, 1994. URL: https://doi.org/10.1007/BF01581152.
  21. L. Lovász. On some connectivity properties of Eulerian graphs. Acta Math. Acad. Sci. Hung., 28(1-2):129-138, 1976. URL: https://doi.org/10.1007/BF01902503.
  22. W. Mader. Über die Maximalzahl kreuzungsfreier H-Wege,. Archiv. Math., 31(1):387-402, 1978. URL: https://doi.org/10.1007/BF01226465.
  23. K. Murota. Discrete Convex Analysis. SIAM, Philadelphia, 2003. Google Scholar
  24. A. Schrijver. Combinatorial Optimization - Polyhedra and Efficiency. Springer-Verlag, Berlin, 2003. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact