Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem