{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:29Z","timestamp":1725483749223},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_32","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:28:20Z","timestamp":1178357300000},"page":"363-372","source":"Crossref","is-referenced-by-count":15,"title":["NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs"],"prefix":"10.1007","author":[{"given":"D. A.","family":"Fotakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. E.","family":"Nikoletseas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. G.","family":"Papadopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"32_CR1","unstructured":"D. Aldous: Random walks in finite groups and rapidly mixing Markov Chains. Seminaire de Probabilites XVII 1981\/82 (A. Dold and B. Eckmann, eds), Springer Lecture Notes in Mathematis986 (1982) 243\u2013297."},{"key":"32_CR2","unstructured":"Geir Agnarsson, Magnus M. Hallorsson: Coloring Powers of planar graphs. Symposium of Discrete Algorithms (2000)."},{"issue":"4","key":"32_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1109\/90.413218","volume":"3","author":"A. A. Bertossi","year":"1995","unstructured":"Alan A. Bertossi and Maurizio A. Bonuccelli: Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE\/ACM Trans. Networking 3, 4 (Aug.) 1995) 441\u2013449.","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"32_CR4","volume-title":"Group representations in probability and statistics","author":"P. Diaconis","year":"1988","unstructured":"P. Diaconis: Group representations in probability and statistics. Institute of Mathematical Statistics, Hayward CA, (1988)."},{"key":"32_CR5","unstructured":"D. Fotakis, G. Pantziou, G. Pentaris and P. Spirakis: Frequency Assignment in Mobile and Radio Networks. Networks in Distributed Computing, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 45 American Mathematical Society (1999) 73\u201390."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"D.A. Fotakis, S.E. Nikoletseas, V.G. Papadopoulou and P.G. Spirakis: NP-completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs. CTI Technical Report (2000) (url: http:\/\/www.cti.gr\/RD1 ).","DOI":"10.1007\/3-540-44612-5_32"},{"key":"32_CR7","unstructured":"D. Fotakis and P. Spirakis: Assignment of Reusable and Non-Reusable Frequencies. International Conference on Combinatorial and Global Optimization (1998)."},{"key":"32_CR8","unstructured":"J. Van D. Heuvel and S. McGuiness: Colouring the square of a Planar Graph. CDAM Research Report Series, Jule (1999)."},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/rsa.3240070205","volume":"7","author":"M. Jerrum","year":"1994","unstructured":"M. Jerrum: A very simple algorithm for estimating the number of k-colourings of a low degree graph. Random Structures and Algorithms 7 (1994) 157\u2013165.","journal-title":"Random Structures and Algorithms"},{"key":"32_CR10","unstructured":"M. Jerrum: Markov Chain Monte Carlo Method. Probabilistic Methods for Algorithmic Discrete Mathematics, Springer (1998)."},{"issue":"2","key":"32_CR11","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/90.222924","volume":"1","author":"S. Ramanathan","year":"1993","unstructured":"S. Ramanathan, E. R. Loyd: Scheduling algorithms for Multi-hop Radio Networks. IEEE\/ACM Trans. on Networking, 1(2): (April) 1993) 166\u2013172.","journal-title":"IEEE\/ACM Trans. on Networking"},{"key":"32_CR12","unstructured":"S. Ramanathan, E. R. Loyd: The complexity of distance2-coloring. 4th International Conference of Computing and information, (1992) 71\u201374."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T14:38:14Z","timestamp":1683815894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}