However, good approximation algorithms for these problems may be helpful in approximating problems in computational biology and computer science.Given an undirected graph G=(V,E) and a family of subsets of vertices S, the minimum crossing spanning tree is a spanning tree where the maximum number of edges crossing any single set in S is minimized, where an edge crosses a set if it has exactly one e