{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:19:38Z","timestamp":1762251578958},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,3,26]],"date-time":"2010-03-26T00:00:00Z","timestamp":1269561600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s11277-010-9963-1","type":"journal-article","created":{"date-parts":[[2010,3,25]],"date-time":"2010-03-25T00:24:23Z","timestamp":1269476663000},"page":"611-633","source":"Crossref","is-referenced-by-count":6,"title":["Analysis of Heuristic Graph Partitioning Methods for the Assignment of Packet Control Units in GERAN"],"prefix":"10.1007","volume":"60","author":[{"given":"Mat\u00edas","family":"Toril","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I\u00f1igo","family":"Molina-Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volker","family":"Wille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Walshaw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,26]]},"reference":[{"key":"9963_CR1","volume-title":"Radio interface system planning for GSM\/GPRS\/UMTS","author":"J. Lempiainen","year":"2001","unstructured":"Lempiainen J., Manninen M. (2001) Radio interface system planning for GSM\/GPRS\/UMTS. Kluwer, Dordrecht"},{"key":"9963_CR2","volume-title":"Radio network planning and optimisation for UMTS","author":"J. Laiho","year":"2002","unstructured":"Laiho J., Wacker A., Novosad T. (2002) Radio network planning and optimisation for UMTS. Wiley, West Sussex"},{"key":"9963_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/0470862696","volume-title":"Fundamental of cellular network planning and optimisation","author":"A. R. Mishra","year":"2004","unstructured":"Mishra A. R. (2004) Fundamental of cellular network planning and optimisation. Wiley, West Sussex"},{"key":"9963_CR4","volume-title":"GSM, GPRS and EDGE performance: Evolution toward 3G\/UMTS","author":"T. Halonen","year":"2002","unstructured":"Halonen T., Melero J., Romero J. (2002) GSM, GPRS and EDGE performance: Evolution toward 3G\/UMTS. Wiley, Chichester"},{"issue":"3","key":"9963_CR5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/LCOMM.2006.1603390","volume":"10","author":"M. Toril","year":"2006","unstructured":"Toril M., Wille V., Barco R. (2006) Optimization of the assignment of cells to packet control units in GERAN. IEEE Communications Letters 10(3): 219\u2013221","journal-title":"IEEE Communications Letters"},{"key":"9963_CR6","volume-title":"CRPC parallel computing handbook","author":"K. Schloegel","year":"2000","unstructured":"Schloegel K., Karypis G., Kumar V. (2000) Graph partitioning for high performance scientific simulations. In: Dongarra J., Foster I., Fox G., Kennedy K., White A. (eds) CRPC parallel computing handbook. Morgan Kaufmann, Los Altos"},{"key":"9963_CR7","unstructured":"Miller, G. L., Teng, S.-H., Thurston, W., & Vavasis, S. A. (1993). Automatic mesh partitioning. In A. George, J. R. Gilbert, & J. Liu (Eds.), Sparse matrix computations: Graph theory issues and algorithms (An IMA Workshop Volume). Springer."},{"key":"9963_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. W. Kernighan","year":"1970","unstructured":"Kernighan B. W., Lin S. (1970) An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal 49: 291\u2013307","journal-title":"Bell System Technical Journal"},{"issue":"3","key":"9963_CR9","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"Pothen A., Simon H. D., Liou K.-P. (1990) Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications 11(3): 430\u2013452","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"9963_CR10","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., & Leland, R. (1995). A multilevel algorithm for partitioning graphs. In Proceedings of 1995 ACM\/IEEE Conference on Supercomputing. ACM Press.","DOI":"10.1145\/224170.224228"},{"issue":"1","key":"9963_CR11","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G. Karypis","year":"1998","unstructured":"Karypis G., Kumar V. (1998) Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing 48(1): 96\u2013129","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"9963_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1137\/S1064827598337373","volume":"22","author":"C. Walshaw","year":"2000","unstructured":"Walshaw C., Cross M. (2000) Mesh partitioning: A multilevel balancing and refinement algorithm. SIAM Journal of Scientific Computing 22(1): 63\u201380","journal-title":"SIAM Journal of Scientific Computing"},{"issue":"5","key":"9963_CR13","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1109\/90.469954","volume":"3","author":"A. Merchant","year":"1995","unstructured":"Merchant A., Sengupta B. (1995) Assignment of cells to switches in PCS networks. IEEE\/ACM Transactions on Networking 3(5): 521\u2013526","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"9963_CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/A:1008850615965","volume":"12","author":"D. Saha","year":"2000","unstructured":"Saha D., Mukherjee A., Bhattacharjee P. S. (2000) A simple heuristic for assignment of cells to switches in a PCS network. Wireless Personal Communications 12: 209\u2013224","journal-title":"Wireless Personal Communications"},{"issue":"5","key":"9963_CR15","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/S0140-3664(01)00371-1","volume":"25","author":"S. Pierre","year":"2002","unstructured":"Pierre S., Houeto F. (2002) A tabu-search approach for assigning cells to switches in cellular mobile networks. Computer Communications 25(5): 465\u2013478","journal-title":"Computer Communications"},{"issue":"3","key":"9963_CR16","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1109\/TWC.2004.827767","volume":"3","author":"I. Demirkol","year":"2004","unstructured":"Demirkol I., Ersoy C., Caglayan M. U., Delic H. (2004) Location area planning and cell-to-switch assignment in cellular networks. IEEE Transactions on Wireless Communications 3(3): 880\u2013890","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"9963_CR17","doi-asserted-by":"crossref","unstructured":"Plehn, J. (1995). The design of location areas in a GSM-network. In Proceedings of 45th IEEE vehicular technology conference (pp. 871\u2013875).","DOI":"10.1109\/VETEC.1995.504993"},{"key":"9963_CR18","doi-asserted-by":"crossref","unstructured":"Gondim, P. (1996). Genetic algorithms and location area partitioning problem in cellular networks. In Proceedings of 46th IEEE vehicular technology conference (pp. 1835\u20131838).","DOI":"10.1109\/VETEC.1996.504075"},{"issue":"4","key":"9963_CR19","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1109\/TWC.2004.830821","volume":"3","author":"P. S. Bhattacharjee","year":"2004","unstructured":"Bhattacharjee P. S., Saha D., Mukherjee A. (2004) An approach for location area planning in~a personal communication services network (PCSN). IEEE Transactions on Wireless Communications 3(4): 1176\u20131187","journal-title":"IEEE Transactions on Wireless Communications"},{"issue":"7","key":"9963_CR20","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1109\/43.644032","volume":"16","author":"L. Hagen","year":"1997","unstructured":"Hagen L., Kahng A. (1997) Combining problem reduction and adaptive multi-start: A new technique for superior iterative partitioning. IEEE Transactions On Computer-Aided Design of Integrated Circuits and Systems 16(7): 709\u2013717","journal-title":"IEEE Transactions On Computer-Aided Design of Integrated Circuits and Systems"},{"key":"9963_CR21","unstructured":"3GPP TS 05.08, Digital cellular telecommunications system (Phase 2); Radio subsystem link control (2000, November)."},{"key":"9963_CR22","unstructured":"3GPP TS 43.129, Packet Switched Handover for GERAN A\/Gb Mode; Stage 2 (2004, May)."},{"key":"9963_CR23","doi-asserted-by":"crossref","unstructured":"Krishnan, R., Ramanathan, R., & Steentrup, M. (1999). Optimization algorithms for large self-structuring networks. In Proceedings of INFOCOM \u201999 (Vol.~1, pp. 71\u201378).","DOI":"10.1109\/INFCOM.1999.749254"},{"key":"9963_CR24","volume-title":"Computers and intractability: A guide to NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey M., Johnson D. (1979) Computers and intractability: A guide to NP-completeness. W.H. Freeman and Company, California"},{"issue":"1","key":"9963_CR25","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/moor.19.1.24","volume":"19","author":"O. Goldschmidt","year":"1994","unstructured":"Goldschmidt O., Hochbaum D. S. (1994) A polynomial algorithm for the k-cut problem for fixed k. Mathematics of Operations Research 19(1): 24\u201337","journal-title":"Mathematics of Operations Research"},{"issue":"1\/2","key":"9963_CR26","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1147\/rd.411.0171","volume":"41","author":"A. Gupta","year":"1997","unstructured":"Gupta A. (1997) Fast and effective algorithms for graph partitioning and sparse matrix ordering. IBM Journal of Research and Development 41(1\/2): 171\u2013184","journal-title":"IBM Journal of Research and Development"},{"key":"9963_CR27","volume-title":"Introduction to algorithms","author":"T. H. Cormen","year":"2001","unstructured":"Cormen T. H., Stein C., Rivest R. L., Leiserson C. E. (2001) Introduction to algorithms. McGraw-Hill Higher Education, New York"},{"issue":"1","key":"9963_CR28","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis G., Kumar V. (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20(1): 359\u2013392","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"2","key":"9963_CR29","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1023\/A:1019148009641","volume":"3","author":"R. Ramanathan","year":"1998","unstructured":"Ramanathan R., Steenstrup M. (1998) Hierarchically-organized, multi-hop mobile wireless networks for quality-of-service support. Mobile Networks and Applications 3(2): 101\u2013119","journal-title":"Mobile Networks and Applications"},{"key":"9963_CR30","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"K. D. Boese","year":"1994","unstructured":"Boese K. D., Khang A., Muddu S. (1994) A new adaptive multi-start technique for combinatorial global optimizations. Operation Research Letters 16: 101\u2013113","journal-title":"Operation Research Letters"},{"issue":"7","key":"9963_CR31","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/12.508322","volume":"45","author":"T. N. Bui","year":"1996","unstructured":"Bui T. N., Moon B. R. (1996) Genetic algorithm and graph partitioning. IEEE Transactions on Computers 45(7): 841\u2013855","journal-title":"IEEE Transactions on Computers"},{"issue":"5\u20136","key":"9963_CR32","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/j.parco.2003.12.016","volume":"30","author":"P. Korosec","year":"2004","unstructured":"Korosec P., Silc J., Robic B. (2004) Solving the mesh-partitioning problem with an ant-colony algorithm. Journal of Parallel Computing 30(5\u20136): 785\u2013801","journal-title":"Journal of Parallel Computing"},{"key":"9963_CR33","unstructured":"Fiduccia, C., Mattheyses, R. (1982). A linear time heuristic for improving network partitions. In Proceedings of 19th ACM\/IEEE design automation conference (pp. 175\u2013181)."},{"key":"9963_CR34","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1023\/B:ANOR.0000039525.80601.15","volume":"131","author":"C. Walshaw","year":"2004","unstructured":"Walshaw C. (2004) Multilevel refinement for combinatorial optimisation problems. Annals of Operations Research 131: 325\u2013372","journal-title":"Annals of Operations Research"},{"issue":"6","key":"9963_CR35","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/LCOMM.2008.072044","volume":"12","author":"M. Toril","year":"2008","unstructured":"Toril M., Wille V. (2008) Optimization of the assignment of base stations to base station controllers in GERAN. IEEE Communications Letters 12(6): 477\u2013479","journal-title":"IEEE Communications Letters"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-010-9963-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-010-9963-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-010-9963-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:05:27Z","timestamp":1559394327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-010-9963-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,26]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9963"],"URL":"https:\/\/doi.org\/10.1007\/s11277-010-9963-1","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,26]]}}}