Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6896369 | European Journal of Operational Research | 2015 | 7 Pages |
Abstract
This paper concerns the problem of decomposing a network flow into an integral path flow such that the length of the longest path is minimized. It is shown that this problem is NP-hard in the strong sense. Two approximation algorithms are proposed for the problem: the longest path elimination (LPE) algorithm and the balanced flow propagation (BFP) algorithm. We analyze the properties of both algorithms and present the results of experimental studies examining their performance and efficiency.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Krzysztof PieÅkosz, Kamil KoÅtyÅ,