{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T06:14:09Z","timestamp":1648707249590},"reference-count":10,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":["Computer Communications"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0140-3664(02)00212-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"774-779","source":"Crossref","is-referenced-by-count":0,"title":["Wavelength assignment to minimize requirement on tunable range of optical transceivers in WDM networks"],"prefix":"10.1016","volume":"26","author":[{"given":"Peng-Jun","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liwu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ophir","family":"Frieder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(02)00212-8_BIB1","unstructured":"G. Blache, M. Karpinski, J. Wirtgen, On approximation intractability of the bandwidth problem, Technical Report TR98-014, ECCC, ftp:\/\/ftp.eccc.uni-trier.de\/pub\/eccc\/reports\/1998\/TR98-014\/index.html., 1998."},{"key":"10.1016\/S0140-3664(02)00212-8_BIB2","series-title":"Fiber Optic Networks","author":"Green","year":"1993"},{"key":"10.1016\/S0140-3664(02)00212-8_BIB3","doi-asserted-by":"crossref","unstructured":"J. Haralambides, F. Makedon, B. Monien, Bandwidth minimization: an approximation algorithm for caterpillars, Math. Syst. Theor. 24, 169\u2013177.","DOI":"10.1007\/BF02090396"},{"key":"10.1016\/S0140-3664(02)00212-8_BIB4","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TC.1981.1675809","article-title":"Design to minimize a diameter on building block network","volume":"C-30","author":"Imase","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0140-3664(02)00212-8_BIB5","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/TC.1983.1676323","article-title":"A design for directed graph with minimal diameter","volume":"C-32","author":"Imase","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0140-3664(02)00212-8_BIB6","unstructured":"M. Karpinski, J. Wirtgen, On approximation hardness of the bandwidth problem, Technical Report TR 97-041, ECCC, ftp:\/\/ftp.eccc.uni-trier.de\/pub\/eccc\/reports\/1997\/TR97-041\/index.html."},{"key":"10.1016\/S0140-3664(02)00212-8_BIB7","unstructured":"M. Karpinski, J. Wirtgen, A. Zelikovsky, An approximation algorithm for the bandwidth problem on dense graphs, Technical Report TR97-017, ECCC, ftp:\/\/ftp.eccc.uni-trier.de\/pub\/eccc\/reports\/1997\/TR97-004\/index.html."},{"key":"10.1016\/S0140-3664(02)00212-8_BIB8","doi-asserted-by":"crossref","unstructured":"T. Kloks, D. Kratsch, H. M\u00fcller, Approximating the bandwidth for asteroidal triple-free graphs, Proceedings of the Third Annual European Symposium on Algorithms, Lecture Notes in Computer Science 979, Springer, Berlin, 1995, pp. 434\u2013447.","DOI":"10.1007\/3-540-60313-1_161"},{"key":"10.1016\/S0140-3664(02)00212-8_BIB9","series-title":"Optical Communication Networks","author":"Mukherjee","year":"1997"},{"key":"10.1016\/S0140-3664(02)00212-8_BIB10","unstructured":"S.M. Reddy, D.K. Pradhan, J.G. Kuhl, Directed graphs with minimal diameter and maximal connectivity, School of Engineering Oakland University Technical Report, 1980."}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402002128?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366402002128?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T05:15:46Z","timestamp":1584508546000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366402002128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":10,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0140366402002128"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(02)00212-8","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}