{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T11:32:20Z","timestamp":1774870340434,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540514985","type":"print"},{"value":"9783540481805","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51498-8_39","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:01:58Z","timestamp":1330203718000},"page":"405-415","source":"Crossref","is-referenced-by-count":11,"title":["Approximation algorithms for channel assignment in cellular radio networks"],"prefix":"10.1007","author":[{"given":"Hans Ulrich","family":"Simon","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"issue":"3","key":"39_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R. J. Fowler","year":"1981","unstructured":"R. J. Fowler, M. S. Paterson, and S. L. Tanimoto. Optimal packing and covering in the plane are NP-complete. Information Processing Lett., 12(3):133\u2013137, June 1981.","journal-title":"Information Processing Lett."},{"key":"39_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman and Company, San Francisco, 1979."},{"issue":"3","key":"39_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theor. Comput. Sci., 1(3):237\u2013267, 1976.","journal-title":"Theor. Comput. Sci."},{"key":"39_CR4","unstructured":"F. Gavril. 1974. unpublished."},{"issue":"5","key":"39_CR5","first-page":"298","volume":"12","author":"M. Grevel","year":"1983","unstructured":"M. Grevel and A. Sachs. A graph theoretical analysis of dynamic channel assignment algorithms for mobile radiocommunication systems. Siemens Forsch. \u2014 u. Entwickl. \u2014 Ber., 12(5):298\u2013305, 1983.","journal-title":"Siemens Forsch. \u2014 u. Entwickl. \u2014 Ber."},{"issue":"1","key":"39_CR6","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D. S. Hochbaum","year":"1985","unstructured":"D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. J. Assoc. Comput. Mach., 32(1):130\u2013136, 1985.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"39_CR7","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. S. Johnson","year":"1974","unstructured":"D. S. Johnson. Approximation algorithms for combinatorial problems. J. Comp. System Sci., 9(3):256\u2013278, 1974.","journal-title":"J. Comp. System Sci."},{"key":"39_CR8","unstructured":"H. W. Lenstra, Jr. Integer Programming with a Fixed Number of Variables. Report 81-03, University of Amsterdam, Apr. 1981."},{"issue":"3","key":"39_CR9","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"S. Sahni and T. Gonzales. P-complete approximation problems. J. Assoc. Comput. Mach., 23(3):555\u2013565, 1976.","journal-title":"J. Assoc. Comput. Mach."},{"key":"39_CR10","unstructured":"H. U. Simon. The Analysis of Dynamic and Hybrid Channel Assignment. SFB 124-B1 10\/1988, Universit\u00e4t des Saarlandes, D-6600 Saarbr\u00fccken, FRG, May 1988."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51498-8_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:03:40Z","timestamp":1619571820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51498-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514985","9783540481805"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-51498-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]}}}