A New Channel Routing Problem

In this paper, we present a new model for channel routing. This model generalizes of the model previously studied in the literature. Informally, our model allow the possibility of connecting, for any given net, only some but not all of the pins that belongs to that net. An algorithm for this model was designed and implemented. Experimental results showed that our algorithm is quite effective.