{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:00Z","timestamp":1750306680036,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,8,11]],"date-time":"2014-08-11T00:00:00Z","timestamp":1407715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,8,11]]},"DOI":"10.1145\/2632951.2632989","type":"proceedings-article","created":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T20:13:39Z","timestamp":1406924019000},"page":"145-154","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Capacity maximization in wireless MIMO networks with receiver-side interference suppression"],"prefix":"10.1145","author":[{"given":"Peng-Jun","family":"Wan","sequence":"first","affiliation":[{"name":"Illinois Institute of Technology, Chicago, USA"}]},{"given":"Boliu","family":"Xu","sequence":"additional","affiliation":[{"name":"Illinois Institute of Technology, Chicago, USA"}]},{"given":"Ophir","family":"Frieder","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington, USA"}]},{"given":"Sai","family":"Ji","sequence":"additional","affiliation":[{"name":"Nanjing University of IST, Nanjing, China"}]},{"given":"Baowei","family":"Wang","sequence":"additional","affiliation":[{"name":"Nanjing University of IST, Nanjing, China"}]},{"given":"Xiaohua","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Toledo, Toledo, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial optimization problems and their approximability properties","author":"Ausiello G.","year":"1999","unstructured":"G. Ausiello , P. Crescenzi , G. Gambosi , V. Kann , A. Marchetti-Spaccamela , and M. Protasi . Complexity and Approximation: Combinatorial optimization problems and their approximability properties , Springer-Verlag , 1999 . G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation: Combinatorial optimization problems and their approximability properties, Springer-Verlag, 1999."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.274"},{"key":"e_1_3_2_1_3_1","first-page":"1","volume-title":"Proceedings of the IEEE SECON","author":"Blough D.","year":"2011","unstructured":"D. Blough , G. Resta , P. Santi , R. Srinivasan , and L.M. Cortes-Pea , Optimal One-Shot Scheduling for Multihop MIMO Networks , Proceedings of the IEEE SECON 2011 , pp. 1 -- 9 . D. Blough, G. Resta, P. Santi, R. Srinivasan, and L.M. Cortes-Pea, Optimal One-Shot Scheduling for Multihop MIMO Networks,Proceedings of the IEEE SECON 2011, pp. 1--9."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374618.1374628"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833872"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISWPC.2008.4556163"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1288107.1288124"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062069"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v54:3"},{"key":"e_1_3_2_1_10_1","first-page":"317","volume-title":"Special Issue on Mobile Ad Hoc Networks","author":"Hu M.","year":"2004","unstructured":"M. Hu and J. Zhang , MIMO Ad Hoc Networks: Medium Access Control,Saturation Throughput and Optimal Hop Distance, Journal of Communications and Networks , Special Issue on Mobile Ad Hoc Networks , pages 317 -- 330 , Dec. 2004 . M. Hu and J. Zhang,MIMO Ad Hoc Networks: Medium Access Control,Saturation Throughput and Optimal Hop Distance, Journal of Communications and Networks, Special Issue on Mobile Ad Hoc Networks, pages 317--330, Dec. 2004."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"Karp R. M.","year":"1972","unstructured":"R. M. Karp , Reducibility Among Combinatorial Problems . Complexity of Computer Computations , R.E. Miller and J.W. Thatcher, Eds., page 85 -- 103 . Plenum Press , New York , 1972 . R. M. Karp,Reducibility Among Combinatorial Problems. Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, Eds., page 85--103. Plenum Press, New York, 1972."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92182-0_22"},{"key":"e_1_3_2_1_13_1","first-page":"1118","volume-title":"Proc. IEEE INFOCOM","author":"Lin X.","year":"2009","unstructured":"X. Lin and S. Rasool , A Distributed Joint Channel-Assignment, Scheduling and Routing Algorithm for Multi-Channel Ad-hoc Wireless Networks , Proc. IEEE INFOCOM 2009 , pp. 1118 -- 1126 . X. Lin and S. Rasool,A Distributed Joint Channel-Assignment, Scheduling and Routing Algorithm for Multi-Channel Ad-hoc Wireless Networks, Proc. IEEE INFOCOM 2009, pp. 1118--1126."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.080808"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833823"},{"key":"e_1_3_2_1_16_1","first-page":"1","article-title":"Algorithmic Aspects of Communications in Multihop Wireless Networks with MIMO Links","author":"Mumey B.","year":"2010","unstructured":"B. Mumey , J. Tang , and T. Hahn , Algorithmic Aspects of Communications in Multihop Wireless Networks with MIMO Links , Proc. IEEE ICC 2010 , pp. 1 -- 6 . B. Mumey, J. Tang, and T. Hahn, Algorithmic Aspects of Communications in Multihop Wireless Networks with MIMO Links, Proc. IEEE ICC 2010, pp. 1--6.","journal-title":"Proc. IEEE"},{"key":"e_1_3_2_1_17_1","volume-title":"An introduction to the theory of numbers","author":"Niven I.","year":"1991","unstructured":"I. Niven , H.S. Zuckerman ,and H.L. Montgomery , An introduction to the theory of numbers 5 th ed., Wiley , 1991 . I. Niven,H.S. Zuckerman,and H.L. Montgomery, An introduction to the theory of numbers 5th ed., Wiley, 1991.","edition":"5"},{"key":"e_1_3_2_1_18_1","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics","author":"Schrijver A.","year":"2003","unstructured":"A. Schrijver , Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics , Vol. 24 , Springer , Berlin , 2003 . A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, Vol. 24, Springer, Berlin, 2003."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2004.42"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2005.35"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11785293_30"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1530748.1530761"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935308"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6847955"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.v9:6"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2006.1678167"}],"event":{"name":"MobiHoc'14: The Fifteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Philadelphia Pennsylvania USA","acronym":"MobiHoc'14"},"container-title":["Proceedings of the 15th ACM international symposium on Mobile ad hoc networking and computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2632951.2632989","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2632951.2632989","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:09Z","timestamp":1750230069000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2632951.2632989"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,11]]},"references-count":26,"alternative-id":["10.1145\/2632951.2632989","10.1145\/2632951"],"URL":"https:\/\/doi.org\/10.1145\/2632951.2632989","relation":{},"subject":[],"published":{"date-parts":[[2014,8,11]]},"assertion":[{"value":"2014-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}