Approximate solution of length-bounded maximum multicommodity flow with unit edge-lengths

TL;DR

This paper introduces an improved approximation scheme and a heuristic for solving the length-bounded maximum multicommodity flow problem with unit edge-lengths, demonstrating trade-offs between accuracy and computational efficiency.

Contribution

It presents a new fully polynomial-time approximation scheme and a greedy heuristic tailored for the length-bounded multicommodity flow problem with unit edge-lengths.

Findings

The algorithms perform well on benchmark and satellite network graphs.

There is a clear trade-off between computational time and solution precision.

Experimental results validate the effectiveness of the proposed methods.

Abstract

An improved fully polynomial-time approximation scheme and a greedy heuristic for the fractional length-bounded maximum multicommodity flow problem with unit edge-lengths are proposed. Computational experiments are carried out on benchmark graphs and on graphs that model software defined satellite networks to compare the proposed algorithms and an exact linear programming solver. The results of experiments demonstrate a trade-off between the computing time and the precision of algorithms under consideration.