No abstract

No abstract

We show how to solve in polynomial time the multicut and the maximum integral multiflow problems in rings. For the latter problem we generalize an approach proposed by Sai Anand and Er-lebach for special cases of the call control problem in ring networks. Moreover, we give linear-time procedures to solve both problems in rings with uniform capacities. keywords. Combinatorial problems, maximum integral multiflow, minimum multicut, ring networks.

No abstract