{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:47:09Z","timestamp":1648925229279},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"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":5342,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0304-3975(98)00156-x","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"347-363","source":"Crossref","is-referenced-by-count":0,"title":["On the hardness of allocating frequencies for hybrid networks"],"prefix":"10.1016","volume":"209","author":[{"given":"Ewa","family":"Malesi\u0144ska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Panconesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00156-X_BIB1","series-title":"Proc. 28th Annual IEEE Symp. on Foundations of Computer Science","first-page":"295","article-title":"Recursive construction for 3-regular expanders","author":"Ajtai","year":"1987"},{"key":"10.1016\/S0304-3975(98)00156-X_BIB2","article-title":"Probabilistic checking of proofs and the hardness of approximation problems","author":"Arora","year":"1994"},{"key":"10.1016\/S0304-3975(98)00156-X_BIB3_1","article-title":"Free bits, PCPs and non-approximability \u2014 towards tight results","author":"Bellare","year":"1995","journal-title":"Tech. Report ECCC TR95-24"},{"key":"10.1016\/S0304-3975(98)00156-X_BIB3_2","series-title":"Proc. 25th ACM Symp. on Theory of Computing","first-page":"113","author":"Bellare","year":"1993"},{"key":"10.1016\/S0304-3975(98)00156-X_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0012-365X(89)90193-3","article-title":"Minimax relations for the partial q-colorings of a graph","volume":"74","author":"Berge","year":"1989","journal-title":"Disc. Math."},{"key":"10.1016\/S0304-3975(98)00156-X_BIB5","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0304-3975(98)00156-X_BIB6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF02110310","article-title":"Graph optimization problems in connection with the management of mobile communication systems","volume":"3","author":"Dahl","year":"1994","journal-title":"Telecommun. Systems"},{"key":"10.1016\/S0304-3975(98)00156-X_BIB7","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1109\/25.260758","article-title":"Design and performance analysis of the algorithms for channel allocation in cellular networks","volume":"42","author":"Dimitrijevi\u0107","year":"1993","journal-title":"IEEE Trans. Vehicular Technol."},{"key":"10.1016\/S0304-3975(98)00156-X_BIB8","series-title":"On coloring unit disk graphs","author":"Gr\u00e4f","year":"1994"},{"key":"10.1016\/S0304-3975(98)00156-X_BIB9","series-title":"41st IEEE Vehicular Technology Conf.","first-page":"693","article-title":"Performance of dynamic channel allocation in the DECT system","author":"Eriksson","year":"1991"},{"key":"10.1016\/S0304-3975(98)00156-X_BIB10","first-page":"1497","article-title":"Frequency assignment: theory and applications","volume":"68","author":"Hale","year":"1980"},{"key":"10.1016\/S0304-3975(98)00156-X_BIB11","series-title":"Proc. 3rd Scandinavian Workshop on Algorithm Theory","first-page":"231","article-title":"Recent results in hardness of approximation","volume":"vol. 824","author":"H\u00e5stad","year":"1994"},{"key":"10.1016\/S0304-3975(98)00156-X_BIB12","series-title":"Graph Coloring Problems","author":"Jensen","year":"1995"},{"key":"10.1016\/S0304-3975(98)00156-X_BIB13","series-title":"Proc. 1st ACM Int. Conf. on Mobile Computing and Networking","first-page":"210","article-title":"An optimization method for the channel assignment in mixed environments","author":"Malesi\u0144ska","year":"1995"},{"key":"10.1016\/S0304-3975(98)00156-X_BIB14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230250205","article-title":"Simple heuristics for unit disk graphs","volume":"25","author":"Marathe","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(98)00156-X_BIB15","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00156-X_BIB16","unstructured":"J. Plehn, Private communication."},{"key":"10.1016\/S0304-3975(98)00156-X_BIB17","article-title":"T-colorings, list T-colorings, and set T-colorings of graphs","author":"Tesman","year":"1989"},{"key":"10.1016\/S0304-3975(98)00156-X_BIB18","series-title":"Wireless communications: Future Directions","first-page":"259","article-title":"Asymptotic bounds on the performance of a class of dynamic channel assignment algorithms","author":"Zander","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759800156X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759800156X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T05:27:12Z","timestamp":1556256432000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759800156X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S030439759800156X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00156-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}