In this section, we show that weighted packet selection for a link is generally NP-hard.

Weighted packet selection for a link is NP-hard.


We show a reduction from the subset sum problem, which is known to be NP-hard [1]}.
In the subset sum problem, we are given a multiset of integers \(\mathcal {I} := \lbrace i_1,i_2,\dots , i_n\rbrace \)  and a target integer \(S\) .
The goal is to find a subset of \(\mathcal {I}\)  with a sum of \(S\) .
