Ordering the data for Lee's algorithm
P.L. Moran, I.R. Price · Electronics Letters · 1976
It is shown that, when using Lee's algorithm for interconnection programs, if the order in which the tracks are routed is determined by the distance between the start and end points of each tracks, on average more paths may be placed than if the order is chosen at random.