{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:23:05Z","timestamp":1648974185511},"reference-count":11,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0020-0190(02)00283-1","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T20:29:59Z","timestamp":1034281799000},"page":"195-199","source":"Crossref","is-referenced-by-count":6,"title":["The on-line first-fit algorithm for radio frequency assignment problems"],"prefix":"10.1016","volume":"84","author":[{"given":"Yin-Te","family":"Tsai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaw-Ling","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.R.","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0020-0190(02)00283-1_BIB001","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1006\/jagm.1996.0827","article-title":"On-line coloring of sparse random graphs and random trees","volume":"23","author":"Pittel","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(02)00283-1_BIB002","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","article-title":"Unit disk graphs","volume":"86","author":"Clark","year":"1990","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/S0020-0190(02)00283-1_BIB003","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/PL00009196","article-title":"On coloring unit disk graphs","volume":"20","author":"Graf","year":"1998","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/S0020-0190(02)00283-1_BIB004","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/jgt.3190120212","article-title":"On-line and first fit colorings of graphs","volume":"12","author":"Gyarfas","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(02)00283-1_BIB005","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","article-title":"Frequency assignment: theory and applications","volume":"68","author":"Hale","year":"1980","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0020-0190(02)00283-1_BIB006","series-title":"Regular Figures","author":"Fejes T\u00f3th","year":"1964"},{"key":"10.1016\/S0020-0190(02)00283-1_BIB007","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0012-365X(89)90096-4","article-title":"An on-line graph coloring algorithm with sublinear performance ratio","volume":"75","author":"Lovasz","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(02)00283-1_BIB008","series-title":"Proc. Math. Foundations of Computer Science","first-page":"471","article-title":"A coloring algorithm for interval graphs","volume":"379","author":"Slusarek","year":"1989"},{"key":"10.1016\/S0020-0190(02)00283-1_BIB009","first-page":"423","article-title":"Optimal on-line coloring of circular arc graphs","volume":"5","author":"Slusarek","year":"1995","journal-title":"Rairo-Automatique-Productique Informatique Industrielle-Automatic Control Production Systems"},{"key":"10.1016\/S0020-0190(02)00283-1_BIB010","series-title":"Proc. 4th Canadian Conference on Computational Geometry","first-page":"244","article-title":"Geometry based approximation for intersecting graphs","author":"Marathe","year":"1992"},{"key":"10.1016\/S0020-0190(02)00283-1_BIB011","unstructured":"R. Peeters, On coloring j-unit sphere graphs, Few 512, Department of Economics, Tilburg University, Netherlands, 1991"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002831?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002831?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T10:00:40Z","timestamp":1554804040000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002002831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0020019002002831"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00283-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}