{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:09:13Z","timestamp":1725491353995},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751410"},{"type":"electronic","value":"9783540751427"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75142-7_33","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T10:00:46Z","timestamp":1188986446000},"page":"435-449","source":"Crossref","is-referenced-by-count":2,"title":["Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks"],"prefix":"10.1007","author":[{"given":"Mordechai","family":"Shalom","sequence":"first","affiliation":[]},{"given":"Prudence W. H.","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Shmuel","family":"Zaks","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"1","key":"33_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1109\/49.974672","volume":"20","author":"G. C\u0103linescu","year":"2002","unstructured":"C\u0103linescu, G., Frieder, O., Wan, P.-J.: Minimizing electronic line terminals for automatic ring protection in general wdm optical networks. IEEE Journal of Selected Area on Communications\u00a020(1), 183\u2013189 (2002)","journal-title":"IEEE Journal of Selected Area on Communications"},{"issue":"4","key":"33_CR3","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1023\/A:1019525904862","volume":"6","author":"G. C\u0103linescu","year":"2002","unstructured":"C\u0103linescu, G., Wan, P.-J.: Traffic partition in wdm\/sonet rings to minimize sonet adms. Journal of Combinatorial Optimization\u00a06(4), 425\u2013453 (2002)","journal-title":"Journal of Combinatorial Optimization"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Epstein, L., Levin, A.: Better bounds for minimizing sonet adms. In: 2nd Workshop on Approximation and Online Algorithms (September 2004)","DOI":"10.1007\/978-3-540-31833-0_23"},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/49.974671","volume":"20","author":"T. Eilam","year":"2002","unstructured":"Eilam, T., Moran, S., Zaks, S.: Lightpath arrangement in survivable rings to minimize the switching cost. IEEE Journal of Selected Area on Communications\u00a020(1), 172\u2013182 (2002)","journal-title":"IEEE Journal of Selected Area on Communications"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11922377_7","volume-title":"Combinatorial and Algorithmic Aspects of Networking","author":"M. Flammini","year":"2006","unstructured":"Flammini, M., Shalom, M., Zaks, S.: On minimizing the number of adms - tight bounds for an algorithm without preprocessing. In: Erlebach, T. (ed.) CAAN 2006. LNCS, vol.\u00a04235, Springer, Heidelberg (2006)"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/11864219_32","volume-title":"Distributed Computing","author":"M. Flammini","year":"2006","unstructured":"Flammini, M., Shalom, M., Zaks, S.: On minimizing the number of adms in a general topology optical network. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 459\u2013473. Springer, Heidelberg (2006)"},{"key":"33_CR8","first-page":"69","volume-title":"INFOCOM 1998","author":"O. Gerstel","year":"1998","unstructured":"Gerstel, O., Lin, P., Sasaki, G.: Wavelength assignment in a wdm ring to minimize cost of embedded sonet rings. In: INFOCOM 1998. 17th Annual Conference of the IEEE Computer and Communications Societies, pp. 69\u201377. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"33_CR9","volume-title":"INFOCOM 1998","author":"O. Gerstel","year":"1998","unstructured":"Gerstel, O., Ramaswami, R., Sasaki, G.: Cost effective traffic grooming in wdm rings. In: INFOCOM 1998. 7th Annual Conference of the IEEE Computer and Communications Societies, IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Vitaletti, A.: Randomized lower bounds for online path coloring. In: 2nd International Workshop on Randomization and Approximation Techniques in Computer Science, pp. 232\u2013247 (1998)","DOI":"10.1007\/3-540-49543-6_19"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Shalom, M., Wong, P.W., Zaks, S.: Optimal on-line colorings for minimizing the number of adms in optical networks. In: Technion, Faculty of Computer Science, Technical Report CS-2007-14 (July 2007)","DOI":"10.1109\/ICTON.2007.4296030"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Shalom, M., Zaks, S.: A 10\/7 + \u03b5 approximation scheme for minimizing the number of adms in sonet rings. In: First Annual International Conference on Broadband Networks, pp. 254\u2013262 (October 2004)","DOI":"10.1109\/BROADNETS.2004.1"},{"issue":"2","key":"33_CR13","first-page":"55","volume":"4","author":"K. Zhu","year":"2003","unstructured":"Zhu, K., Mukherjee, B.: A review of traffic grooming in wdm optical networks: Architecture and challenges. Optical Networks Magazine\u00a04(2), 55\u201364 (2003)","journal-title":"Optical Networks Magazine"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75142-7_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:52:42Z","timestamp":1619506362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540751410","9783540751427"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}