Single-source k-splittable min-cost flows

Article

Abstract: Motivated by a famous open question on the single-source unsplittable minimum cost flow problem, we

Palabras claves:

Approximation algorithm, k-splittable flow, Multi-commodity flow, Network flow, routing, Unsplittable flow

Autores:

Fernanda Salazar, Skutella M.

Fuentes:

scopus