{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T05:29:06Z","timestamp":1733290146115,"version":"3.30.1"},"reference-count":28,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5737,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0166-218x(97)00040-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"155-170","source":"Crossref","is-referenced-by-count":1,"title":["Optimal channel allocation for several types of cellular radio networks"],"prefix":"10.1016","volume":"79","author":[{"given":"Thomas","family":"Niessen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/S0166-218X(97)00040-1_BIB1"},{"key":"10.1016\/S0166-218X(97)00040-1_BIB2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(82)90091-3","article-title":"A solution of the Sperner-Erd\u00f6s problem","volume":"21","author":"Berenguer","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(97)00040-1_BIB3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0166-218X(95)80003-M","article-title":"On the k-coloring of intervals","volume":"59","author":"Carlisle","year":"1995","journal-title":"Discrete Appl. Math."},{"volume":"vol. 65","year":"1997","author":"Engel","key":"10.1016\/S0166-218X(97)00040-1_BIB4"},{"key":"10.1016\/S0166-218X(97)00040-1_BIB5","first-page":"37","article-title":"Analysis of multicelluar mobile radiotelephone systems with loss","volume":"1","author":"Everitt","year":"1983","journal-title":"British Telecom Techn. J."},{"year":"1962","series-title":"Flows in Networks","author":"Ford","key":"10.1016\/S0166-218X(97)00040-1_BIB6"},{"key":"10.1016\/S0166-218X(97)00040-1_BIB7","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(97)00040-1_BIB8","first-page":"658","article-title":"Optimum dynamic channel allocation in certain street microcellular radio systems","volume":"42","author":"Frodigh","year":"1992"},{"key":"10.1016\/S0166-218X(97)00040-1_BIB9","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1109\/25.312804","article-title":"Bounds on the performance of DCA-algorithms in highway microcellular systems","volume":"43","author":"Frodigh","year":"1994","journal-title":"IEEE Trans. Veh. Technol."},{"key":"10.1016\/S0166-218X(97)00040-1_BIB10","first-page":"1","article-title":"Optimization Algorithms for large networks","volume":"vol. 885","author":"Goldberg","year":"1994"},{"key":"10.1016\/S0166-218X(97)00040-1_BIB11","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","article-title":"A new approach to the maximum flow problem","volume":"35","author":"Goldberg","year":"1988","journal-title":"J. ACM"},{"year":"1980","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","key":"10.1016\/S0166-218X(97)00040-1_BIB12"},{"key":"10.1016\/S0166-218X(97)00040-1_BIB13","first-page":"301","article-title":"A reduction and closure algorithm for graphs","volume":"vol. 74","author":"Goralc\u0306ikov\u00e1","year":"1979"},{"key":"10.1016\/S0166-218X(97)00040-1_BIB14","first-page":"325","article-title":"Polynomial algorithms for perfect graphs","volume":"21","author":"Gr\u00f6tschel","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(97)00040-1_BIB15","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0167-6377(86)90099-4","article-title":"On the continued Erlang loss function","volume":"5","author":"Jagers","year":"1986","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(97)00040-1_BIB16","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1111\/j.2517-6161.1985.tb01367.x","article-title":"Stochastic models of computer communication systems","volume":"47","author":"Kelly","year":"1985","journal-title":"J. Roy. Statist. Soc. B"},{"key":"10.1016\/S0166-218X(97)00040-1_BIB17","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1109\/25.69987","article-title":"Channel assignment for cellular radio using neural networks","volume":"40","author":"Kunz","year":"1991","journal-title":"IEEE Trans. Veh. Tech."},{"key":"10.1016\/S0166-218X(97)00040-1_BIB18","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lov\u00e1sz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(97)00040-1_BIB19","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1109\/25.260746","article-title":"Channel Allocation in Cellular Radio Networks","volume":"42","author":"Mathar","year":"1993","journal-title":"IEEE Trans. Veh. Technol."},{"article-title":"Analyse and Optimierung mobiler Kommunikationssyteme","year":"1994","author":"Mattfeldt","key":"10.1016\/S0166-218X(97)00040-1_BIB20"},{"key":"10.1016\/S0166-218X(97)00040-1_BIB21","first-page":"181","article-title":"Optimal channel assignment in cellular radio networks with linear structure","volume":"vol. 135","author":"Niessen","year":"1995"},{"key":"10.1016\/S0166-218X(97)00040-1_BIB22","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0304-3975(93)90259-V","article-title":"Quantifiers and approximation","volume":"107","author":"Panconesi","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(97)00040-1_BIB23","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/BF01185340","article-title":"Maximum k-covering of weighted transitive graphs with applications","volume":"9","author":"Sarrafzadeh","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(97)00040-1_BIB24","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0214048","article-title":"On comparability and permutation graphs","volume":"14","author":"Spinrad","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(97)00040-1_BIB25","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1214\/aoms\/1177697805","article-title":"On Erlang's formula","volume":"40","author":"Tak\u00e1cs","year":"1969","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/S0166-218X(97)00040-1_BIB26","article-title":"Data structures and network algorithms","volume":"vol. 44","author":"Tarjan","year":"1983"},{"key":"10.1016\/S0166-218X(97)00040-1_BIB27","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","article-title":"The maximum k-colorable subgraph problem for chordal graphs","volume":"24","author":"Yannakakis","year":"1987","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/S0166-218X(97)00040-1_BIB28","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1109\/25.289419","article-title":"The nonuniform compact pattern allocation algorithm for cellular mobile systems","volume":"40","author":"Zhang","year":"1991","journal-title":"IEEE Trans. Veh. Technol."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000401?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000401?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T20:15:12Z","timestamp":1733256912000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":28,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0166218X97000401"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00040-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}