this problem is strictly easier than TSP or discourse ordering.
since it is known that there can be no polynomial algorithms that compute -approximations for general ATsP, for any (Cormen et al., 1990), this means that dPDOP cannot be approximated either (unless P=NP): Any polynomial algorithm for dPDOP will compute arbitrarily bad solutions on certain inputs.