{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:30:13Z","timestamp":1740547813539,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540244677"},{"type":"electronic","value":"9783540305828"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30582-8_3","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T06:10:32Z","timestamp":1283839832000},"page":"21-30","source":"Crossref","is-referenced-by-count":1,"title":["On the Load-Balanced Demand Points Assignment Problem in Large-Scale Wireless LANs"],"prefix":"10.1007","author":[{"given":"Chor Ping","family":"Low","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Can","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/35.965365","volume":"39","author":"A. Hills","year":"2001","unstructured":"Hills, A.: Large-scale wireless LAN design. IEEE Communications Magzine\u00a039, 98\u2013107 (2001)","journal-title":"IEEE Communications Magzine"},{"key":"3_CR2","unstructured":"Lee, Y., Kim, K., Choi, Y.: Optimization of AP placement and channel assignment in wireless LANs. In: Proceedings. LCN 2002. 27th Annual IEEE Conference on Local Computer Networks, November 2002, pp. 831\u2013836 (2002)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Nagy, L., Farkas, L.: Indoor base station location optimisation using genetic algorithms. In: IEEE PIMRC 2000, vol.\u00a02, pp. 843\u2013846 (2000)","DOI":"10.1109\/PIMRC.2000.881541"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Kamenetsky, M., Unbehaun, M.: Coverage planning for outdoor Wireless LAN system. International Zurich Seminar on Broadband Communications (2002)","DOI":"10.1109\/IZSBC.2002.991793"},{"key":"3_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman company, New York (1979)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Chang, C.Y., Chang, C.T., Huang, P.C.: Dynamic channel assignment and reassignment for exploiting channel reuse opportunities in ad hoc wireless networks. In: The 8th International Conference on Communication Systems(ICCS 2002) (2002)","DOI":"10.1109\/ICCS.2002.1183293"},{"key":"3_CR7","unstructured":"Yeung, K.L., Yum, T.P.: Fixed channel assignment optimisation for cellular mobile networks. IEICE TRANS. Communication\u00a0E83-B (August 2000)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Shashanka, M.V.S., Pati, A., Shende, A.M.: A characterisation of optimal channel assignments for wireless networks modelled as cellular and square grids. In: International Parallel and Distributed Processing Symposium (IPDPS 2003) (April 2003)","DOI":"10.1109\/IPDPS.2003.1213406"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/A:1019126406181","volume":"5","author":"S. Ramanathan","year":"1999","unstructured":"Ramanathan, S.: A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks\u00a05, 81\u201394 (1999)","journal-title":"Wireless Networks"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Programming\u00a046, 259\u2013271 (1990)","journal-title":"Math. Programming"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-44929-9_10","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"E.V. Shchepin","year":"2000","unstructured":"Shchepin, E.V., Vakhania, N.V.: Task distributions on multiprocessor systems. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, pp. 112\u2013125. Springer, Heidelberg (2000)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Karp, R.M.: An n2.5 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing, 135\u2013158 (1973)","DOI":"10.1137\/0202012"}],"container-title":["Lecture Notes in Computer Science","Information Networking. Convergence in Broadband and Mobile Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30582-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T16:17:36Z","timestamp":1740500256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30582-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540244677","9783540305828"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30582-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}