Parametric Permutation Routing via Matchings

The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a framework which makes the analysis simple and local.

• Type: Journal
• Year: 1998
• Where: NJC
• Authors: Peter Høyer, Kim S. Larsen
• Keywords: Different Heuristics, General Algorithm, NJC 1998, Permutations