July 1, 1984

Some complexity results about packet radio networks (Corresp.)

Key Points

Key points are not available for this paper at this time.

Abstract

It is shown that the decision problem regarding the membership of a point in the capacity region of a packet radio network is nondeterministic polynomial time hard (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.

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Cite This Study

Erdal Arıkan (Sun,) studied this question.

synapsesocial.com/papers/6a2080fde1fa5be4a5f41ef0 https://doi.org/https://doi.org/10.1109/tit.1984.1056928

Discussion

Journals

IEEE Transactions on Information Theory

Institutions

Massachusetts Institute of Technology

Decision Systems (United States)

References and Citations

Add This Paper to Your Research Feed

Any time a new paper drops it will be there.