The k-distance strong shortest path union cover of a graph is the minimum cardinality among all strong shortest path union cover at distance k of G where 1 ≤ k ≤ d. In this paper we determine the 2-strong shortest path union cover for certain graphs, also we prove that the kstrong shortest path union cover problem in general is NP-complete.