Is the Minimum Steiner Tree problem NP-hard even on (2D, unweighted) grid graph ? A proof (for either case) will be very appreciated.Thank YouGilad 
Hardness of the Minimum Steiner Tree problem on grid
complexity theory;np complete