2008 | OriginalPaper | Buchkapitel
Multicommodity Flows and Edge-Disjoint Paths
Erschienen in: Combinatorial Optimization
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The
Multicommodity Flow Problem
is a generalization of the
Maximum Flow Problem
. Given a digraph with edge capacities, we now ask for an
s-t
-flow for several pairs (
s, t
) (we speak of several commodities), such that the total flow through any edge does not exceed the capacity. We specify the pairs (
s, t
) by a second digraph; for technical reasons we have an edge from
t
to
s
when we ask for an
s-t
-flow. Formally we have: