The difficulty of finding good embeddings of program graphs onto the OPAM architecture

We describe a problem that arises in mapping process graphs onto a certain communication architecture. The problem is called bounded p contractability. We have shown in earlier work that the problem is NP complete. We present two results: the first is a result on a corresponding approximation problem and the second is a heuristic for the problem based on local search. The heuristic is compared with an existing heuristic for the problem.