Fastest way to run Steiner tree on large graph?
I have a very large graph (25GB, 35 million edges) and a collection of nodes. I want to find a tree that has all of those nodes; a tree that minimizes the number of edges but maximizes the number of the nodes covered.