{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:03:03Z","timestamp":1649113383881},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1007\/bf01202544","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T14:50:47Z","timestamp":1109256647000},"page":"221-226","source":"Crossref","is-referenced-by-count":0,"title":["On the complexity of finding sparsest and densest parts in wireless networks"],"prefix":"10.1007","volume":"1","author":[{"given":"Andr\ufffds","family":"Farag\ufffd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"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. Inf. Th. 30 (1984) 681?685.","journal-title":"IEEE Trans. Inf. Th."},{"key":"CR2","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 NP-completeness of certain network testing problems, Networks 14 (1984) 1?24.","journal-title":"Networks"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"N. Alon, A. Bar-Noy, N. Linial and D. Peleg, On the complexity of radio communication,Proc. Twenty First Ann. ACM Symp. on the Theory of Computing, Seattle, Washington (1989) pp. 274?285.","DOI":"10.1145\/73007.73033"},{"key":"CR4","first-page":"37","volume":"1","author":"D.E. Everitt","year":"1983","unstructured":"D.E. Everitt and N.W. MacFadyen, Analysis of multicellular mobile radio telephone systems with loss, BT Tech. J. 1 (1983) 37?45.","journal-title":"BT Tech. J."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/90.282605","volume":"2","author":"I. Chlamtac","year":"1994","unstructured":"I. Chlamtac and A. Farag\u00f3, Making transmission schedules immune to topology changes in multi-hop packet radio networks, IEEE\/ACM Trans. Networking 2 (1994) 23?29.","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"1426","DOI":"10.1109\/49.329334","volume":"12","author":"I. Chlamtac","year":"1994","unstructured":"I. Chlamtac, A. Farag\u00f3 and H.Y. Ahn, A topology transparent link activation protocol for mobile CDMA radio networks, IEEE J. Select. Areas Commun. 12 (1994) 1426?1433.","journal-title":"IEEE J. Select. Areas Commun."},{"key":"CR7","unstructured":"I. Chlamtac, A. Farag\u00f3 and T. Zhang, Optimizing the system of virtual paths, to appear in IEEE\/ACM Trans. Networking."},{"issue":"7","key":"CR8","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1109\/TCOM.1987.1096847","volume":"35","author":"I. Chlamtac","year":"1987","unstructured":"I. Chlamtac and A. Lerner, Fair algorithms for maximal link activation in multihop radio networks, IEEE Trans. Commun. COM-35(7) pp. 739?746, July 1987.","journal-title":"IEEE Trans. Commun. COM"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1109\/TC.1987.1676965","volume":"36","author":"I. Chlamtac","year":"1987","unstructured":"I. Chlamtac and S.S. Pinter, Distributed node organization algorithm for channel access in a multihop dynamic radio network, IEEE Trans. Comp. 36 (1987) 728?737.","journal-title":"IEEE Trans. Comp."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1109\/26.79285","volume":"39","author":"I. Chlamtac","year":"1991","unstructured":"I. Chlamtac and O. Weinstein, The wave expansion approach to broadcasting in multihop radio networks, IEEE Trans. Commun. 39 (1991) 426?433.","journal-title":"IEEE Trans. Commun."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1109\/12.35830","volume":"38","author":"I. Cidon","year":"1989","unstructured":"I. Cidon and M. Sidi, Distributed assignment algorithms for multihop packet radio networks, IEEE Trans. Comp. 38 (1989) 1353?1361.","journal-title":"IEEE Trans. Comp."},{"key":"CR12","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. Commun. 38 (1990) 456?460.","journal-title":"IEEE Trans. Commun."},{"key":"CR13","unstructured":"B. Hajek, Balanced scheduling in a packet synchronized spread spectrum network,IEEE INFOCOM (1983) pp. 56?65."},{"key":"CR14","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 sceduling in polynomial time, IEEE Trans. Inf. Th. 34 (1988) 910?917.","journal-title":"IEEE Trans. Inf. Th."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF01553897","volume":"4","author":"M.J. Post","year":"1989","unstructured":"M.J. Post, A.S. Kershenbaum and P.E. Sarachik, Scheduling multihop CDMA networks in the presence of secondary conflicts, Algorithmica 4 (1989) 365?394.","journal-title":"Algorithmica"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"A.A. Bertossi and M.A. Bonucelli, Code assignment for hidden terminal interference avoidance in multihop packet radio networks,Proc. INFOCOM'92, pp. 701?709.","DOI":"10.1109\/INFCOM.1992.263490"},{"key":"CR17","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1983","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability (Freeman, San Francisco, 1983)."},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"M. Bellare and M. Sudan, Improved non-approximability results,Proc. 26th Ann. ACM Symp. on the Theory of Computing, Montreal, Canada (1994) pp. 184?193.","DOI":"10.1145\/195058.195129"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.3230120206","volume":"12","author":"J.-C. Picard","year":"1982","unstructured":"J.-C. Picard and M. Queyranne, A network flow solution to some nonlinear 0?1 programming problems with application to graph theory, Networks 12 (1982) 141?159.","journal-title":"Networks"},{"key":"CR20","unstructured":"A. Farag\u00f3,f-independence number of graphs,Proc. 27th Hungarian Conf. on Combinatorics, Finite and Infinite Sets, Eger, Hungary (1987) pp. 221?226."}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202544.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01202544\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:01:52Z","timestamp":1556730112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01202544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF01202544"],"URL":"https:\/\/doi.org\/10.1007\/bf01202544","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}