On the complexity of and algorithms for finding the shortest path with a disjoint counterpart