The cavity approach for Steiner trees Packing problems
share
The Belief Propagation approximation, or cavity method, has been recently applied to several combinatorial optimization problems in its zero-temperature implementation, the Max-Sum algorithm. In particular, recent developments to solve the Edge-Disjoint paths problem and the Prize collecting Steiner tree Problem on graphs have shown remarkable results for several classes of graphs and for benchmark instances. Here we propose a generalization of these techniques for two variants of the Steiner trees packing problem where multiple "interacting" trees have to be sought within a given graph. Depending on the interaction among trees we distinguish the Vertex-Disjoint Steiner trees Problem, where trees cannot share nodes, from the Edge-Disjoint Steiner trees Problem, where edges cannot be shared by trees but nodes can be members of multiple trees. Several practical problems of huge interest in network design can be mapped into these two variants, for instance, the physical design of Very Large Scale Integration (VLSI) chips. The formalism described here relies on two components edge-variables that allows us to formulate a massage-passing algorithm for the V-DStP and two algorithms for the E-DStP differing in the scaling of the computational time with respect to some relevant parameters. We will show that one of the two formalisms used for the edge-disjoint variant allow us to map the Max-Sum update equations into a weighted maximum matching problem over proper bipartite graphs. The solution of the MS equations allows to non-rigorously estimate the maximum number of trees that can be accommodated on several ensembles of random networks, including regular and fully-connected graphs. We developed a heuristic procedure based on the Max-Sum equations that shows excellent performance in synthetic networks and on large benchmark instances of VLSI.
READ FULL TEXT