Multitasking Capacity: Hardness Results and Improved Constructions
Author(s): Alon, Noga M.; Cohen, Jonathan D.; Griffiths, Tom; Manurangsi, Pasin; Reichman, Daniel; et al
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr17h1dn0s| Publication Date: | Jan-2020 |
| Electronic Publication Date: | 24-Mar-2020 |
| Citation: | Alon, Noga, Cohen, Jonathan D, Griffiths, Thomas L, Manurangsi, Pasin, Reichman, Daniel, Shinkar, Igor, Wagner, Tal, Yu, Alexander. (2020). Multitasking Capacity: Hardness Results and Improved Constructions. SIAM Journal on Discrete Mathematics, 34 (1), 885 - 903. doi:10.1137/18m1224672 |
| DOI: | doi:10.1137/18m1224672 |
| ISSN: | 0895-4801 |
| EISSN: | 1095-7146 |
| Keywords: | matching, connected matchings, hardness of approximation, wireless networks |
| Pages: | 885 - 903 |
| Language: | en |
| Type of Material: | Journal Article |
| Journal/Proceeding Title: | SIAM Journal on Discrete Mathematics |
| Version: | Author's manuscript |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.