"Polynomial Complexity Minimum-Time Scheduling in a Class of Wireless Networks."

Qing He et al. (2016)

> Home

Details and statistics

DOI: 10.1109/TCNS.2015.2512678

access: closed

type: Journal Article

metadata version: 2020-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcns/HeAEY16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcns/HeAEY16
Qing He, Vangelis Angelakis, Anthony Ephremides, Di Yuan:
Polynomial Complexity Minimum-Time Scheduling in a Class of Wireless Networks. IEEE Trans. Control. Netw. Syst. 3(3): 322-331 (2016)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.