{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:18Z","timestamp":1725558978447},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262244"},{"type":"electronic","value":"9783540324409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_35","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T06:29:15Z","timestamp":1279088955000},"page":"320-329","source":"Crossref","is-referenced-by-count":0,"title":["Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks"],"prefix":"10.1007","author":[{"given":"Xiaodong","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianping","family":"Shuai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1007\/3-540-45465-9_67","volume-title":"Automata, Languages and Programming","author":"U. Adamy","year":"2002","unstructured":"Adamy, U., Ambuehl, C., Anand, R.S., Erlebach, T.: Call control in rings. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 788\u2013799. Springer, Heidelberg (2002)"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1109\/49.510913","volume":"14","author":"D. Banerjee","year":"1996","unstructured":"Banerjee, D., Mukherjee, B.: A practical approach for routing and wavelength assignment in large wavelength-routed Optical Networks. IEEE Journal of Selected Areas in Communications\u00a014, 903\u2013908 (1996)","journal-title":"IEEE Journal of Selected Areas in Communications"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0166-218X(93)E0174-W","volume":"59","author":"M.C. Carlisle","year":"1995","unstructured":"Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Applied Mathematics\u00a059, 225\u2013235 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-44683-4_31","volume-title":"Mathematical Foundations of Computer Science 2001","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T.: Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 351\u2013362. Springer, Heidelberg (2001)"},{"issue":"3","key":"35_CR5","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1137\/S0895480199361259","volume":"14","author":"T. Erlebach","year":"2001","unstructured":"Erlebach, T., Jansen, K.: The maximum edge-disjoint paths problem in bidirected trees. SIAM Journal on Discrete Mathematics\u00a014(3), 326\u2013355 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"35_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/3-540-49381-6_20","volume-title":"Algorithms and Computation","author":"T. Erlabach","year":"1998","unstructured":"Erlabach, T., Jansen, K.: Maximizing the number of connections in optical tree networks. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol.\u00a01533, pp. 179\u2013188. Springer, Heidelberg (1998)"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica\u00a018, 3\u201320 (1997)","journal-title":"Algorithmica"},{"issue":"12","key":"35_CR8","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1109\/TC.1979.1675260","volume":"C-28","author":"U.I. Gupta","year":"1979","unstructured":"Gupta, U.I., Lee, D.T., Leung, J.Y.-T.: An optimal solution for the channel-assignment problem. IEEE Transactions on Computers\u00a0C-28(12), 807\u2013810 (1979)","journal-title":"IEEE Transactions on Computers"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1002\/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5","volume":"45","author":"D.S. Hochbaum","year":"1998","unstructured":"Hochbaum, D.S., Pathria, A.: Analysis of the greedy approach in problems of maximum k-coverage. Naval Research quarterly\u00a045, 615\u2013627 (1998)","journal-title":"Naval Research quarterly"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S1389-1286(02)00448-6","volume":"42","author":"C. Nomikos","year":"2003","unstructured":"Nomikos, C., Pagourtzis, A., Zachos, S.: Satisfying a maximun number of pre-routed requests in all-optical rings. Computer Networks\u00a042, 55\u201363 (2003)","journal-title":"Computer Networks"},{"issue":"5","key":"35_CR11","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/90.469957","volume":"3","author":"R. Ramaswami","year":"1995","unstructured":"Ramaswami, R., Sivarajan, K.N.: Routing and wavelength assignment in all-optical networks. IEEE\/ACM Transactions on Networking\u00a03(5), 489\u2013500 (1995)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"2","key":"35_CR12","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TNET.2004.826251","volume":"12","author":"A. Sridharran","year":"2004","unstructured":"Sridharran, A., Sivarajan, K.N.: Blocking in all-optical networks. IEEE\/ACM Transactions on Networking\u00a012(2), 384\u2013397 (2004)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Slusarek, M.: A coloring algorithm for interval graphs. LNCS, vol. 379, pp. 471\u2013480 (1989)","DOI":"10.1007\/3-540-51486-4_93"},{"key":"35_CR14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1090\/dimacs\/046\/02","volume":"48","author":"P.-J. Wan","year":"1998","unstructured":"Wan, P.-J., -Liu, L.: Maximal throughput in wavelength-routed optical networks. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a048, 15\u201327 (1998)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"issue":"8","key":"35_CR15","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1109\/JSAC.2003.816596","volume":"21","author":"J. Wang","year":"2003","unstructured":"Wang, J., Chen, B., Uma, R.N.: Dynamic wavelength assignment for multicast in all-optical WDM networks to maximize the network capacity. IEEE Journal of Select Areas in Communications\u00a021(8), 1274\u20131284 (2003)","journal-title":"IEEE Journal of Select Areas in Communications"},{"key":"35_CR16","unstructured":"Wilfong, G., Winkler, P.: Ringrouting and wavelength translation. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 333\u2013341 (1998)"},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","volume":"24","author":"M. Yannakakis","year":"1987","unstructured":"Yannakakis, M., Gavril, F.: The maximum k-colorable subgraph problem for chordal graph. Information Processing Letters\u00a024, 133\u2013137 (1987)","journal-title":"Information Processing Letters"},{"key":"35_CR18","unstructured":"Zhang, X., Qiao, C.: Wavelength assignment for dynamic traffic in multifiber WDM networks. In: Proceedings of IEEE International Conference on Computer Communication and Networks, pp. 479\u2013485 (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:00:14Z","timestamp":1605625214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11496199_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}