The k-DST Problem Following Ref. [3], we consider a version of the DST problem, called k-DST, in which only part of the terminals must be covered.
確定! 回上一頁