It is shown that the decision problem regarding the membership of a point in the capacity region of a packet radio network is NP-hard. The capacity region is the set of all feasible origin-to-destination message rates where feasibility is defined as the existence of any set of rules for moving the data through the network so that the desired rates are satisfied. *-The research was conducted at M.I.T.
As an example, REF uses a graph representation to show that determining whether a traffic matrix belongs to the capacity region of a packet radio network is NP hard.
Some complexity results about packet radio networks
IEEE Transactions on Information Theory
Computer Science