We present a new heuristic method for minimising crossings in a graph. The method is based upon repeatedly solving the so-called {\em star insertion problem} in the setting where the combinatorial embedding is fixed, and has several desirable characteristics for practical use... (read more)
PDF