#### Filter Results:

#### Publication Year

2002

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Data networks are subject to congestion, thereby the delay to go across the network may be large enough in order to dishearten customers to keep on using such a network. In this paper we address the problem of determining in a given network a routing which minimizes the delay or keeps it under a certain bound. This problem was already shown as N P complete.… (More)

Given a bidirected ring with capacities and a demand graph, we present an approximation algorithm to the problem of finding the minimum α such that there exists a feasible unsplittable routing of the demands after multiplying each capacity by α. We also give an approximation scheme to the problem.

- ‹
- 1
- ›