{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:41:55Z","timestamp":1740145315877,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,12,10]],"date-time":"2016-12-10T00:00:00Z","timestamp":1481328000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Natural Science Foundation of China (CN)","award":["61309015"],"award-info":[{"award-number":["61309015"]}]},{"name":"Ministry of Science of Slovenia","award":["0101-P-297"],"award-info":[{"award-number":["0101-P-297"]}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2013CB329601"],"award-info":[{"award-number":["2013CB329601"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10100-016-0462-7","type":"journal-article","created":{"date-parts":[[2016,12,10]],"date-time":"2016-12-10T13:25:06Z","timestamp":1481376306000},"page":"699-723","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Frequency assignment problem in networks with limited spectrum"],"prefix":"10.1007","volume":"25","author":[{"given":"Zehui","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3705-0071","authenticated-orcid":false,"given":"Aleksander","family":"Vesel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,10]]},"reference":[{"key":"462_CR1","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/j.jpdc.2003.11.005","volume":"64","author":"T Calamoneri","year":"2004","unstructured":"Calamoneri T, Petreschi R (2004) \n                        $$L(h, 1)$$\n                        \n                            \n                                            \n                                \n                                    L\n                                    (\n                                    h\n                                    ,\n                                    1\n                                    )\n                                \n                            \n                        \n                    -labeling subclasses of planar graphs. J Parallel Distrib Comput 64:414\u2013426","journal-title":"J Parallel Distrib Comput"},{"key":"462_CR2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"GJ Chang","year":"1996","unstructured":"Chang GJ, Kuo D (1996) The \n                        $$L(2, 1)$$\n                        \n                            \n                                            \n                                \n                                    L\n                                    (\n                                    2\n                                    ,\n                                    1\n                                    )\n                                \n                            \n                        \n                    -labeling problem on graphs. SIAM J Discret Math 9:309\u2013316","journal-title":"SIAM J Discret Math"},{"key":"462_CR3","doi-asserted-by":"crossref","first-page":"2439","DOI":"10.11650\/twjm\/1500406480","volume":"15","author":"M Chia","year":"2011","unstructured":"Chia M, Kuo D, Liao H, Yang C, Yeh RK (2011) \n                        $$L(3, 2, 1)$$\n                        \n                            \n                                            \n                                \n                                    L\n                                    (\n                                    3\n                                    ,\n                                    2\n                                    ,\n                                    1\n                                    )\n                                \n                            \n                        \n                    -labeling of graphs. Taiwan J Math 15:2439\u20132457","journal-title":"Taiwan J Math"},{"key":"462_CR4","volume-title":"$$L(3, 2, 1)$$","author":"J Clipperton","year":"2006","unstructured":"Clipperton J, Gehrtz J, Szaniszlo Z, Torkornoo D (2006) \n                        $$L(3, 2, 1)$$\n                        \n                            \n                                            \n                                \n                                    L\n                                    (\n                                    3\n                                    ,\n                                    2\n                                    ,\n                                    1\n                                    )\n                                \n                            \n                        \n                    -labeling of simple graphs. Valparaiso University, Verum"},{"key":"462_CR5","doi-asserted-by":"publisher","unstructured":"Dai B, Lin WW (2015) On \n                        $$(s, t)$$\n                        \n                            \n                                            \n                                \n                                    (\n                                    s\n                                    ,\n                                    t\n                                    )\n                                \n                            \n                        \n                    -relaxed \n                        $$L(2, 1)$$\n                        \n                            \n                                            \n                                \n                                    L\n                                    (\n                                    2\n                                    ,\n                                    1\n                                    )\n                                \n                            \n                        \n                    -labelings of the triangular lattice. J Comb Optim 29:655\u2013669. doi:\n                        10.1007\/s10878-013-9615-y","DOI":"10.1007\/s10878-013-9615-y"},{"key":"462_CR6","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1016\/j.ipl.2013.06.012","volume":"113","author":"B Dai","year":"2013","unstructured":"Dai B, Lin W (2013) On \n                        $$(s, t)$$\n                        \n                            \n                                            \n                                \n                                    (\n                                    s\n                                    ,\n                                    t\n                                    )\n                                \n                            \n                        \n                    -relaxed \n                        $$L(2, 1)$$\n                        \n                            \n                                            \n                                \n                                    L\n                                    (\n                                    2\n                                    ,\n                                    1\n                                    )\n                                \n                            \n                        \n                    -labelings of the square lattice. Inf Process Lett 113:704\u2013709","journal-title":"Inf Process Lett"},{"key":"462_CR7","doi-asserted-by":"crossref","unstructured":"Duan Z-M, Lv P-l, Miao L-Y, Miao Z-K (2010) Optimal channel assignment for wireless networks modelled as hexagonal and square grids. In: Proceedings of 2nd IEEE international conference on network security, wireless communications and trusted computing (NSWCTC), pp 85\u201388","DOI":"10.1109\/NSWCTC.2010.156"},{"key":"462_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.ejor.2008.01.028","volume":"195","author":"A Dupont","year":"2009","unstructured":"Dupont A, Linhares AC, Artigues C, Feillet D, Michelon P, Vasquez M (2009) The dynamic frequency assignment problem. Eur J Oper Res 195:75\u201388","journal-title":"Eur J Oper Res"},{"key":"462_CR9","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs JR, Yeh RK (1992) Labelling graphs with a condition at distance 2. SIAM J Discret Math 5:586\u2013595","journal-title":"SIAM J Discret Math"},{"key":"462_CR10","first-page":"596","volume":"17","author":"L Jia-zhuang","year":"2004","unstructured":"Jia-zhuang L, Zhen-dong S (2004) The \n                        $$L(3, 2, 1)$$\n                        \n                            \n                                            \n                                \n                                    L\n                                    (\n                                    3\n                                    ,\n                                    2\n                                    ,\n                                    1\n                                    )\n                                \n                            \n                        \n                    -labeling problem on graphs. Math Appl 17:596\u2013602","journal-title":"Math Appl"},{"key":"462_CR11","doi-asserted-by":"crossref","first-page":"2243","DOI":"10.1080\/00207160.2014.981536","volume":"92","author":"BM Kim","year":"2015","unstructured":"Kim BM, Rho Y, Song BC (2015) \n                        $$L(h, k)$$\n                        \n                            \n                                            \n                                \n                                    L\n                                    (\n                                    h\n                                    ,\n                                    k\n                                    )\n                                \n                            \n                        \n                    -labelling for octagonal grid. Int J Comput Math 92:2243\u20132250","journal-title":"Int J Comput Math"},{"key":"462_CR12","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1109\/TCSII.2005.861884","volume":"53","author":"S Klav\u017ear","year":"2006","unstructured":"Klav\u017ear S, \u0160pacapan S (2006) The \n                        $${\\varDelta }^2$$\n                        \n                            \n                                            \n                                \n                                    \n                                        \u0394\n                                    \n                                    2\n                                \n                            \n                        \n                    -conjecture for \n                        $$L(2, 1)$$\n                        \n                            \n                                            \n                                \n                                    L\n                                    (\n                                    2\n                                    ,\n                                    1\n                                    )\n                                \n                            \n                        \n                    -labelings is true for direct and strong products of graphs. IEEE Trans Circuits Syst II Exp Briefs 53:274\u2013277","journal-title":"IEEE Trans Circuits Syst II Exp Briefs"},{"key":"462_CR13","first-page":"513","volume":"4708","author":"J Kratochv\u00edl","year":"2007","unstructured":"Kratochv\u00edl J, Kratsch D, Liedloff M (2007) Exact algorithms for \n                        $$L(2,1)$$\n                        \n                            \n                                            \n                                \n                                    L\n                                    (\n                                    2\n                                    ,\n                                    1\n                                    )\n                                \n                            \n                        \n                    -labeling of Graphs, MFCS 2007. LNCS 4708:513\u2013524","journal-title":"LNCS"},{"key":"462_CR14","doi-asserted-by":"publisher","unstructured":"Lin W (2016) On \n                        $$(s, t)$$\n                        \n                            \n                                            \n                                \n                                    (\n                                    s\n                                    ,\n                                    t\n                                    )\n                                \n                            \n                        \n                    -relaxed \n                        $$L(2, 1)$$\n                        \n                            \n                                            \n                                \n                                    L\n                                    (\n                                    2\n                                    ,\n                                    1\n                                    )\n                                \n                            \n                        \n                    -labeling of graphs. J Comb Optim 31:405\u2013426. doi:\n                        10.1007\/s10878-014-9746-9","DOI":"10.1007\/s10878-014-9746-9"},{"key":"462_CR15","unstructured":"LINGO 13.0 (2016) Optimization Modeling Software for Linear, Nonlinear, and Integer Programming. \n                        http:\/\/www.lindo.com\/index.php?option=com_content&view=article&id=2&Itemid=10"},{"key":"462_CR16","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1049\/iet-com.2012.0568","volume":"7","author":"Z Shao","year":"2013","unstructured":"Shao Z, Vesel A (2013) Integer linear programming model and satisfiability test reduction for distance constrained labellings of graphs: the case of \n                        $$L(3, 2, 1)$$\n                        \n                            \n                                            \n                                \n                                    L\n                                    (\n                                    3\n                                    ,\n                                    2\n                                    ,\n                                    1\n                                    )\n                                \n                            \n                        \n                     labelling for products of paths and cycles. IET Commun 7:715\u2013720","journal-title":"IET Commun"},{"key":"462_CR17","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1007\/s10100-014-0365-4","volume":"23","author":"Z Shao","year":"2015","unstructured":"Shao Z, Vesel A (2015) \n                        $$L(3,2,1)$$\n                        \n                            \n                                            \n                                \n                                    L\n                                    (\n                                    3\n                                    ,\n                                    2\n                                    ,\n                                    1\n                                    )\n                                \n                            \n                        \n                    -labeling of triangular and toroidal grids. Cent Eur J Oper Res 23:659\u2013673","journal-title":"Cent Eur J Oper Res"},{"key":"462_CR18","unstructured":"Shao Z, Zhu E, Vesel A, Xu J, Zhang X (2016) The complexity of (1,0)-relaxed \n                        $$L(2,1)$$\n                        \n                            \n                                            \n                                \n                                    L\n                                    (\n                                    2\n                                    ,\n                                    1\n                                    )\n                                \n                            \n                        \n                    -labeling of graphs, submitted"},{"key":"462_CR19","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-V","volume":"29","author":"J Heuvel van den","year":"1998","unstructured":"van den Heuvel J, Leese RA, Shepherd MA (1998) Graph labeling and radio channel assignment. J Graph Theory 29:263\u2013283","journal-title":"J Graph Theory"},{"key":"462_CR20","first-page":"135","volume":"6","author":"J \u017derovnik","year":"1998","unstructured":"\u017derovnik J (1998) On the convergence of a randomized algorithm frequency assignment problem. Cent Eur J Oper Res Econ 6:135\u2013151","journal-title":"Cent Eur J Oper Res Econ"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-016-0462-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-016-0462-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-016-0462-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T11:21:22Z","timestamp":1589714482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-016-0462-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,10]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["462"],"URL":"https:\/\/doi.org\/10.1007\/s10100-016-0462-7","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2016,12,10]]}}}