## Metric Inequalities for Routings on Direct Connections

Please always quote using this URN: urn:nbn:de:0297-zib-44219
• We consider multi-commodity flow problems in which capacities are installed on paths. In this setting, it is often important to distinguish between flows on direct connection routes, using single paths, and flows that include path switching. We show that the concept of metric inequalities to characterize capacities that support a multi-commodity flow can be generalized to deal with direct connections.

$Rev: 13581$