Given a graph $G=(V,E)$ with two distinguished vertices $s,t\in V$ and an integer $L$, an {\em $L$-bounded flow} is a flow between $s$ and $t$ that can be decomposed into paths of length at most $L$. In the {\em maximum $L$-bounded flow problem} the task is to find a maximum $L$-bounded flow between a given pair of vertices in the input graph.
The problem can be solved in polynomial time using linear programming. However, as far as we know, no polynomial-time combinatorial algorithm for the $L$-bounded flow is known. The only attempt, that we are aware of, to describe a combinatorial algorithm for the maximum $L$-bounded flow problem was done by Koubek and Ří ha in 1981. Unfortunately, their paper contains substantional flaws and the algorithm does not work; in the first part of this paper, we describe these problems.
In the second part of this paper we describe a combinatorial algorithm based on the exponential length method that finds a $(1+ε)$-approximation of the maximum $L$-bounded flow in time $O(ε^{-2}m^2 L\log L)$ where $m$ is the number of edges in the graph. Moreover, we show that this approach works even for the NP-hard generalization of the maximum $L$-bounded flow problem in which each edge has a length.
Approximating maximum properly colored forests via degree bounded independent sets
School of Mathematics and Statistics, Northwestern Polytechnical University(西北工业大学数学与统计学院);Xi’an-Budapest Joint Research Center for Combinatorics(西安-布达佩斯组合学联合研究中心);MTA-ELTE Matroid Optimization Research Group(匈牙利科学院-罗兰大学拟阵优化研究组)
Communication complexity of approximate maximum matching in the message-passing model
我们考虑了在多方消息传递通信模型中寻找图中的近似最大匹配的通信复杂性。最大匹配问题是最基本的图组合问题之一,有着广泛的应用。该问题的输入是一个图$G$,该图具有$n$顶点和在$k$站点上划分的边集,以及一个逼近比参数$α$。要求输出是$G$中的匹配,必须由其中一个站点报告,其大小至少是$G$中最大匹配大小的因子$α$。我们证明了这个问题的通信复杂性是$Ω(α^2 k n)$信息位。这个界限被证明是紧到一个$\log n$因素,通过构建一个算法,建立其正确性,和上界的通信成本。该下界也适用于消息传递通信模型中的其他图组合问题,包括最大流和图稀疏化。
Enumeration algorithms for combinatorial problems using Ising machines: When should we stop exploring energy landscapes?
Research Institute for Electronic Science, Hokkaido University(北海道大学电子科学研究所);Institute for Chemical Reaction Design and Discovery (WPI-ICReDD), Hokkaido University(北海道大学化学反应设计与发现研究所(WPI-ICReDD));Graduate School of Chemical Sciences and Engineering, Hokkaido University(北海道大学理工研究院);Statistics Discipline, Khulna University(库尔纳大学统计学系);SANKEN, The University of Osaka(大阪大学基础工学研究所)