The Edge-Disjoint Path Problem on Random Graphs by Message-Passing

  title={The Edge-Disjoint Path Problem on Random Graphs by Message-Passing},
  author={Fabrizio Altarelli and Alfredo Braunstein and Luca Dall’Asta and Caterina De Bacco and Silvio Franz},
  journal={PLoS ONE},
We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be performed efficiently by exploiting a mapping of a generalized edge-disjoint path problem on a star… 
A Message Passing Algorithm for the Problem of Path Packing in Graphs
Comparisons show that the proposed new algorithm scales better to large instances than IP-based algorithms and often finds better solutions than a simple algorithm that greedily selects the longest path from each root node.
Solving the edge-disjoint paths problem using a two-stage method
The proposed approach hybridizes an Integer Linear Programming formulation of the problem with an Evolutionary Algorithm and shows that the proposed procedure compares favorably to previous metaheuristics for this problem.
Scalable Node-Disjoint and Edge-Disjoint Multi-wavelength Routing
The scalable principled method developed is exact on trees but provides good approximate solutions on locally tree-like graphs and provides the tool for settling an open and much debated question on the merit of wavelength-switching nodes and the added capabilities they provide.
The cavity approach for Steiner trees Packing problems
A heuristic procedure based on the max-sum equations that shows excellent performance in synthetic networks and on large benchmark instances of VLSI for which the optimal solution is known, on which the algorithm found the optimum in two cases and the gap to optimality was never larger than 4 %.
Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
The LaPSO algorithm, which draws on ideas from both mathematical programming and evolutionary algorithms, is able to outperform both MIP and metaheuristic solvers that only use ideas from one of these areas, making it a “quasi-exact” method.
Decentralized network control, optimization and random walks on networks
In the last years several problems been studied at the interface between statistical physics and computer science. The reason being that often these problems can be reinterpreted in the language of
Self-organization scheme for balanced routing in large-scale multi-hop networks
This work applies belief propagation (its min-sum version) to solve the network optimization problem and obtains a distributed algorithm whereby the nodes collectively discover globally optimal routes by performing low-complexity computations and exchanging messages with their neighbours.
Coordinating dynamical routes with statistical physics on space-time networks.
  • C. Yeung
  • Medicine, Physics
    Physical review. E
  • 2019
This paper first applies the cavity approach in statistical physics to derive the theoretical behavior and an optimization algorithm for dynamical route coordination, then maps static spatial networks to space-time networks to derive a computational feasible message-passing algorithm compatible with arbitrary system parameters.
Multicommodity routing optimization for engineering networks
Optimizing passengers routes is crucial to design efficient transportation networks. Recent results show that optimal transport provides an efficient alternative to standard optimization methods.
Vehicle routing in urban areas based on the Oil Consumption Weight -Dijkstra algorithm
In this study, the authors refine a route-planning algorithm, in order to improve the route planning strategy in urban areas under traffic congestion. Considering the Oil Consumption Weight (OCW) and


Disjoint paths in densely embedded graphs
  • J. Kleinberg, É. Tardos
  • Mathematics, Computer Science
    Proceedings of IEEE 36th Annual Foundations of Computer Science
  • 1995
This work considers the class of densely embedded, nearly-Eulerian graphs, which includes the two-dimensional mesh and other planar and locally planar interconnection networks, and obtains a constant-factor approximation algorithm for the maximum disjoint paths problem for this class of graphs.
A genetic algorithm for the maximum edge-disjoint paths problem
A genetic algorithm (GA) is proposed to solve the maximum edge-disjoint paths problem (MEDP), and in comparison to the multi-start simple greedy algorithm (MSGA), the proposed GA method performs better in most of the instances in terms of solution quality and time.
Ant Colony Optimization for the Maximum Edge-Disjoint Paths Problem
This work proposes an Ant Colony Optimization (aco) algorithm, inspired by the foraging behavior of real ants, whose distributed nature makes them suitable for the application in network environments.
Minimum energy disjoint path routing in wireless ad-hoc networks
Algorithms for finding minimum energy disjoint paths in an all-wireless network are developed, for both the node and link-disjoint cases, and it is found that link- Disjointpaths consume substantially less energy than node-disJoint paths.
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
An improved hardness result for EDP is obtained, and the first polylogarithmic integrality gaps and hardness of approximation results for E DPwC are shown, and similar results can be obtained for the all-or-nothing flow (ANF) problem, a relaxation of EDP.
New Hardness Results for Undirected Edge Disjoint Paths
In the edge-disjoint paths (EDP) problem, we are given a graph G and a set of source-sink pairs in G. The goal is connect as many pairs as possible in an edge-disjoint manner. This problem is NP-hard
Approximating disjoint-path problems using packing integer programs
Improved approximation algorithms for column-restricted packing integer programs are developed that are simple to implement and achieve good performance when the input has a special structure and are motivated by the disjoint paths applications.
LS(Graph): a constraint-based local search for constraint optimization on trees and paths
A constraint- based local search framework for COT/COP applications is proposed, bringing the compositionality, reuse, and extensibility at the core of constraint-based local search and constraint programming systems.
Maximizing number of satisfiable routing requests in static ad hoc networks
GDP, a greedy algorithm called GDP that has a constant approximation ratio to the optimal algorithm, is proposed that outperforms MECBE, which outperforms the state-of-the-art online algorithm OML, in terms of the number of satisfiable requests, the average energy consumption per request, and thenumber of energy-depleted nodes.
Shortest node-disjoint paths on random graphs
A method based on message-passing techniques to process global information and distribute paths optimally to find the shortest paths between given source/destination pairs while avoiding path overlaps at nodes is proposed.