1. Introduction. We study a relaxation of the following network flow problem introduced by Kleinberg [1]: Single-source unsplittable min-cost flow problem.

The resulting relaxation of our unsplittable flow problem is the single-source k-splittable min-cost flow problem. It fol- lows from the classical flow ...

Motivated by a famous open question on the single-source unsplittable minimum cost flow problem, we present a new approximation result for the relaxation of ...

Motivated by a famous open question on the single-source unsplittable minimum cost flow problem, we present a new approximation result for the relaxation of ...

Oct 22, 2024 · Salazar et al. (2006) considered the single source k-splittable flow problem. They used rounding up strategy and designed an approximation ...

ABSTRACT: In this paper, we mainly consider the complexity of the k-splittable flow minimizing congestion problem. We give some complexity results. For the k- ...

AbstractIn traditional multi-commodity flow theory, the task is to send a certain amount of each commodity from its start to its target node, ...

In this paper, we propose a new heuristic algorithm which finds a feasible path set for each commodity, and then select some paths from the path set through a ...

Using branch-and-price to solve multicommodity k-splittable flow problems · Christophe Duhamel. 2005 ; On the Fixed Cost k-Flow Problem and related problems⋆.

They used rounding up strategy and designed an approximation algorithm with factor (1+1/k+1/(2k-1), 1) for minimum congestion and cost under the same assumption ...