Algoritmy pro L-omezené toky

We study the problem of maximum $L$-bounded flow, a flow decomposable to flow paths of length bounded by $L$. We review the basic results and related problems. Maximum $L$-bounded flow can be computed in polynomial time in networks with unit edge lengths but combinatorial algorithm is not known. We study combinatorial approach to this question. In networks with general edge lengths, the problem is \cNP-hard; for this problem we describe a fully polynomial approximation scheme (FPTAS) based on an algorithm for maximum multicommodity flow. This approach is practically more efficient than the previous FPTAS which was based on the ellipsoid method. Powered by TCPDF (www.tcpdf.org