Before revision:  We minimize the number of bundled crossings. We consider two settings. In the first setting, a graph is given and the goal is to find a bundled drawing with at most k  crossings.
After revision:  We consider the problem of bundled crossing minimization: A graph is given and the goal is to find a bundled drawing with at most k crossings.