Before revision:  In particular, for the case of k=2, we improve the current best lower bounds on biplanar crossing numbers by a factor of 1.37 for complete graphs, and by a factor of 1.34 for complete bipartite graphs.
After revision:  In particular, we prove that the biplanar crossing number of complete bipartite graphs can be approximated to within a factor of 1.37 for complete graphs, and by a factor of 1.34 for complete bipartite graphs.