| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 483233 | European Journal of Operational Research | 2007 | 6 Pages |
Abstract
In this paper, we present a simple polynomial-time algorithm solving the shortest multipaths problem in particular grid graphs called dense channels. Our work extends the results of Formann et al. [M. Formann, D. Wagner, F. Wagner, Routing through a dense channel with minimum total wire length, Journal of Algorithms 15 (1993) 267–283], by considering arbitrary horizontal and vertical capacities.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Maria Zrikem,