{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:36:37Z","timestamp":1759667797487,"version":"3.43.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Networks"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1023\/a:1019128411323","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T18:30:27Z","timestamp":1045679427000},"page":"71-82","source":"Crossref","is-referenced-by-count":73,"title":["A new model for scheduling packet radio networks"],"prefix":"10.1007","volume":"3","author":[{"given":"Arunabha","family":"Sen","sequence":"first","affiliation":[]},{"given":"Mark L.","family":"Huson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"July","key":"330333_CR1","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1109\/TIT.1984.1056928","volume":"30","author":"E. Arikan","year":"1984","unstructured":"E. Arikan, Some complexity results about packet radio networks, IEEE Trans. Inform. Theory 30 (July 1984) 681\u2013685.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"330333_CR2","doi-asserted-by":"crossref","unstructured":"R. Bar-Yehuda, A. Israeli and A. Itai, Multiple communication in multi-hop radio networks, in: Proc. 8th Ann. ACM Sympos. Princ. Distrib. Comput. (ACM, 1989) pp. 329\u2013338.","DOI":"10.1145\/72981.73005"},{"key":"330333_CR3","doi-asserted-by":"crossref","unstructured":"T. Biedl and G. Kant, A better heuristic for orthogonal graph drawing, in: Proc. 2nd Ann. European Sympos. Algorithms (1994).","DOI":"10.1007\/BFb0049394"},{"key":"330333_CR4","unstructured":"I. Chlamtac and S. Kutten, A spatial reuse tdma\/fdma for mobile multihop radio networks, in: INFOCOM (IEEE, March 1985) pp. 389\u2013394."},{"key":"330333_CR5","unstructured":"I. Chlamtac and A. Lerner, A link allocation protocol for mobile multi-hop radio networks, in: GLOBECOM (IEEE, 1985) pp. 238\u2013242."},{"key":"330333_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B. N. Clark","year":"1990","unstructured":"B. N. Clark, C. J. Colbourn and D. S. Johnson, Unit disk graphs, Discrete Math. 86 (1990) 165\u2013177.","journal-title":"Discrete Math."},{"key":"330333_CR7","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1109\/26.52656","volume":"38","author":"A. Ephremides","year":"1990","unstructured":"A. Ephremides and T. V. Truong, Scheduling broadcasts in multihop radio networks, IEEE Trans. Communications 38 (April 1990) 456\u2013461.","journal-title":"IEEE Trans. Communications"},{"key":"330333_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230140102","volume":"14","author":"S. Even","year":"1984","unstructured":"S. Even, O. Goldreich, S. Moran and P. Tong, On the NPcompleteness of certain network testing problems, Networks 14 (1984) 1\u201324.","journal-title":"Networks"},{"key":"330333_CR9","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, 1979)."},{"key":"330333_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, D. S. Johnson and L. J. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237\u2013267.","journal-title":"Theoret. Comput. Sci."},{"issue":"November","key":"330333_CR11","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1109\/TC.1979.1675260","volume":"28","author":"U. I. Gupta","year":"1979","unstructured":"U. I. Gupta, D. T. Lee and J. Y.-T. Leung, An optimal solution for the channel\u2013assignment problem, IEEE Trans. Computers 28 (November 1979) 807\u2013810.","journal-title":"IEEE Trans. Computers"},{"issue":"September","key":"330333_CR12","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/18.21215","volume":"34","author":"B. Hajek","year":"1988","unstructured":"B. Hajek and G. Sasaki, Link scheduling in polynomial time, IEEE Trans. Inform. Theory 34 (September 1988) 910\u2013917.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"330333_CR13","volume-title":"A new model for scheduling radio networks","author":"M. L. Huson","year":"1995","unstructured":"M. L. Huson, A new model for scheduling radio networks, Ph.D. thesis, Arizona State University, Tempe, AZ (August 1995)."},{"key":"330333_CR14","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0196-6774(82)90018-9","volume":"3","author":"D. S. Johnson","year":"1982","unstructured":"D. S. Johnson, The NP-completeness column: An ongoing guide, J. Algorithms 3 (1982) 182\u2013195.","journal-title":"J. Algorithms"},{"key":"330333_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0166-218X(84)90113-6","volume":"7","author":"H. Maehara","year":"1984","unstructured":"H. Maehara, Space graphs and sphericity, Discrete Appl. Math. 7 (1984) 55\u201364.","journal-title":"Discrete Appl. Math."},{"key":"330333_CR16","doi-asserted-by":"crossref","unstructured":"S.T. McCormick, Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem, Technical Report SOL 81-22, Stanford University, Department of Operations Research (1981).","DOI":"10.21236\/ADA110846"},{"key":"330333_CR17","unstructured":"R. Ogier, A decomposition method for optimal link scheduling, in: Proc. 24th Allerton Conf. (October 1986) pp. 822\u2013823."},{"key":"330333_CR18","doi-asserted-by":"crossref","unstructured":"S. Ramanathan and E. L. Lloyd, Scheduling algorithms for multi-hop radio networks, in: SIGCOM (ACM, 1992) pp. 211\u2013222.","DOI":"10.1145\/144179.144283"},{"key":"330333_CR19","doi-asserted-by":"crossref","unstructured":"S. Ramanathan and E. L. Lloyd, Scheduling algorithms for multihop radio networks, IEEE\/ACM Trans. Networking 1 (April 1993) 166\u2013172.","DOI":"10.1109\/90.222924"},{"key":"330333_CR20","doi-asserted-by":"crossref","unstructured":"R. Ramaswami and K. K. Parhi, Distributed scheduling of broadcasts in a radio network, in: INFOCOM (IEEE, 1989) pp. 497\u2013504.","DOI":"10.1109\/INFCOM.1989.101493"},{"key":"330333_CR21","doi-asserted-by":"crossref","unstructured":"L. G. Valiant, Universality considerations in VLSI circuits, IEEE Trans. Computers 30 (February 1981) 135\u2013140.","DOI":"10.1109\/TC.1981.6312176"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019128411323.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019128411323\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019128411323.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T11:56:24Z","timestamp":1755086184000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019128411323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["330333"],"URL":"https:\/\/doi.org\/10.1023\/a:1019128411323","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"type":"print","value":"1022-0038"},{"type":"electronic","value":"1572-8196"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}