The shortest multipaths problem in a capacitated dense channel

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. [5], by considering arbitrary horizontal and vertical capacities.

• Type: Journal
• Year: 2007
• Where: EOR
• Authors: Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Maria Zrikem
• Keywords: Dense Channels, EOR 2007, Shortest Multipaths Problem, Simple Polynomial-time Algorithm