{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:22:45Z","timestamp":1742934165723,"version":"3.40.3"},"publisher-location":"Dordrecht","reference-count":19,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789400758599"},{"type":"electronic","value":"9789400758605"}],"license":[{"start":{"date-parts":[[2012,12,11]],"date-time":"2012-12-11T00:00:00Z","timestamp":1355184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,12,11]],"date-time":"2012-12-11T00:00:00Z","timestamp":1355184000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-94-007-5860-5_44","type":"book-chapter","created":{"date-parts":[[2012,12,10]],"date-time":"2012-12-10T12:00:32Z","timestamp":1355140832000},"page":"363-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Graph Coloring Algorithms and Applications to the Channel Assignment Problems"],"prefix":"10.1007","author":[{"given":"Surgwon","family":"Sohn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,11]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Hale WK (1980) Frequency assignment: theory and applications. In: Proceedings of the IEEE, vol 68, pp 1497\u20131514","DOI":"10.1109\/PROC.1980.11899"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Giortzis AI, Turner LF (1997) Application of mathematical programming to the fixed channel assignment problem in mobile radio networks. In: IEEE Proceedings of Communication, vol 144, pp. 257\u2013264","DOI":"10.1049\/ip-com:19971249"},{"key":"44_CR3","unstructured":"Carlsson M, Grindal M (1993) Automatic frequency assignment for cellular telephone using constraint satisfaction techniques. In: Proceedings of the tenth international conference on logic programming, pp 647\u2013665"},{"key":"44_CR4","unstructured":"Walsher JP (1996) Feasible cellular frequency assignment using constraint programming abstractions. In: Proceedings of the workshop on constraint programming applications, Cambridge"},{"key":"44_CR5","unstructured":"Skiena S (1998) The Algorithm Design Manual, Springer, New York"},{"issue":"4","key":"44_CR6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u2032elaz","year":"1979","unstructured":"Br\u2032elaz D (1979) New methods to color the vertices of a graph. Commun ACM 22(4):251\u2013256","journal-title":"Commun ACM"},{"issue":"3","key":"44_CR7","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.4007\/annals.2005.162.1335","volume":"162","author":"D Achlioptas","year":"2005","unstructured":"Achlioptas D, Naor A (2005) The two possible values of the chromatic number of a random graph. Ann Math 162(3):1333\u20131349","journal-title":"Ann Math"},{"key":"44_CR8","first-page":"739","volume":"4304","author":"S Sohn","year":"2006","unstructured":"Sohn S, Jo GS (2006) Solving a constraint satisfaction problem for frequency assignment in low power FM broadcasting. Lect Notes Artif Intell 4304:739\u2013748","journal-title":"Lect Notes Artif Intell"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Zhou S, Luo Z, Wong E, Tan CJ, Luo J (2007) Interconnected RFID reader collision model and its application in reader anti-collision. In: Proceeding of the 2007 IEEE international conference on RFID, pp 212\u2013219","DOI":"10.1109\/RFID.2007.346171"},{"key":"44_CR10","unstructured":"Engels DW, Sarma SE (2002) The reader collision problem. In: Proceedings of the 2002 IEEE international conference on systems, man and cybernetics, pp 92\u201397"},{"issue":"1","key":"44_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.4103\/0256-4602.74511","volume":"28","author":"SK Sayeed","year":"2011","unstructured":"Sayeed SK, Kim YS, Yang H, Yook JG (2011) A solution to the RFID reader interference problem using adaptive beam-forming approach. IETE Tech Rev 28(1):17\u201328","journal-title":"IETE Tech Rev"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Song I, Hong S, Chang (2009) An improved reader Anti-collision algorithm based on pulse protocol with slot occupied probability in dense reader mode. In: Proceeding of the IEEE 69th vehicular technology conference, pp 1\u20135","DOI":"10.1109\/VETECS.2009.5073385"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Yu J, Lee W (2008) GENTLE: reducing reader collision in mobile RFID networks. In: Proceeding of the 4th international conference on mobile Ad-hoc and sensor networks, pp 280\u2013287","DOI":"10.1109\/MSN.2008.31"},{"key":"44_CR14","unstructured":"Tian J, Fan Y, Zhu Y, Hu K (2008) RFID reader anti-collision using chaos neural network based on annealing strategy. In: Proceeding of the world congress on intelligent control and automation, pp. 6128\u20136132"},{"issue":"4","key":"44_CR15","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1145\/321296.321300","volume":"12","author":"SW Golomb","year":"1965","unstructured":"Golomb SW, Baumert LD (1965) Backtrack programming. J ACM 12(4):516\u2013524","journal-title":"J ACM"},{"issue":"3","key":"44_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"RM Haralick","year":"1980","unstructured":"Haralick RM, Elliott GL (1980) Increasing tree search efficiency for constraint satisfaction problems. Artif Intell 14(3):263\u2013313","journal-title":"Artif Intell"},{"issue":"1","key":"44_CR17","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"EC Freuder","year":"1982","unstructured":"Freuder EC (1982) A sufficient condition for backtrack-free search. J ACM 29(1):24\u201332","journal-title":"J ACM"},{"key":"44_CR18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-61551-2_66","volume":"1118","author":"C Bessi`ere","year":"1996","unstructured":"Bessi`ere C, R\u2032egin J-C (1996) MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. Lect Notes Comput Sci 1118:61\u201375","journal-title":"Lect Notes Comput Sci"},{"key":"44_CR19","unstructured":"Boussemart F, Hemery F, Lecoutre C Sais L (2004) Boosting systematic search by weighting constraints. In: Proceeding of the ECAI, pp 146\u2013150"}],"container-title":["Lecture Notes in Electrical Engineering","IT Convergence and Security 2012"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-94-007-5860-5_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T08:12:11Z","timestamp":1676794331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-94-007-5860-5_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,11]]},"ISBN":["9789400758599","9789400758605"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-94-007-5860-5_44","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2012,12,11]]},"assertion":[{"value":"11 December 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}