{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T21:42:39Z","timestamp":1794346959581,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540729136","type":"print"},{"value":"9783540729143","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72914-3_23","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T05:37:26Z","timestamp":1182836246000},"page":"262-271","source":"Crossref","is-referenced-by-count":6,"title":["On the Complexity of the Traffic Grooming Problem in Optical Networks"],"prefix":"10.1007","author":[{"given":"Mordechai","family":"Shalom","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Walter","family":"Unger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shmuel","family":"Zaks","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Bermond, J.-C., Braud, L., Coudert, D.: Traffic grooming on the path. In: 12th Colloqium on Structural Information and Communication Complexity, Le Mont Saint-Michel, France (May 2005)","DOI":"10.1007\/11429647_5"},{"key":"23_CR2","unstructured":"Bermond, J.-C., Coudert, D.: Traffic grooming in unidirectional WDM ring networks using design theory. In: IEEE ICC, Anchorage, Alaska (May 2003)"},{"issue":"1","key":"23_CR3","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":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/50.818901","volume":"18","author":"A.L. Chiu","year":"2000","unstructured":"Chiu, A.L., Modiano, E.H.: Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. Journal of Lightwave Technology\u00a018(1), 2\u201312 (2000)","journal-title":"Journal of Lightwave Technology"},{"issue":"4","key":"23_CR5","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"},{"issue":"4","key":"23_CR6","first-page":"66","volume":"24","author":"R. Dutta","year":"2006","unstructured":"Dutta, R., Huang, S., Rouskas, G.N.: Traffic grooming in path, star and tree networks: Complexity, bounds, and algorithms. IEEE Journal on Selected Areas in Communications\u00a024(4), 66\u201382 (2006)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Epstein, L., Levin, A.: Better bounds for minimizing SONET ADMs. In: 2nd Workshop on Approximation and Online Algorithms, Bergen, Norway (September 2004)","DOI":"10.1007\/978-3-540-31833-0_23"},{"issue":"1","key":"23_CR8","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":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11602613_91","volume-title":"Algorithms and Computation","author":"M. Flammini","year":"2005","unstructured":"Flammini, M., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the traffic grooming problem. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, Springer, Heidelberg (2005)"},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1002\/net.10054","volume":"41","author":"O. Goldschmidt","year":"2003","unstructured":"Goldschmidt, O., Hochbaum, D.S., Levin, A., Olinick, E.V.: The sonet edge-partition problem. NETWORKS\u00a041(1), 32\u201337 (2003)","journal-title":"NETWORKS"},{"key":"23_CR11","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"23_CR12","first-page":"69","volume-title":"INFOCOM\u201998, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies","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\u201998, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 69\u201377. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"23_CR13","volume-title":"INFOCOM\u201998, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies","author":"O. Gerstel","year":"1998","unstructured":"Gerstel, O., Ramaswami, R., Sasaki, G.: Cost effective traffic grooming in WDM rings. In: INFOCOM\u201998, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"23_CR14","unstructured":"Huang, S.: Traffic Grooming in Wavelength Routed Path Networks. PhD thesis, North Carolina State University (2002)"},{"key":"23_CR15","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, San-Jos\u00e9, California, USA, pp. 254\u2013262 (October 2004)","DOI":"10.1109\/BROADNETS.2004.1"},{"issue":"2","key":"23_CR16","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","Fun with Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72914-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T17:04:04Z","timestamp":1737133444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72914-3_23"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540729136","9783540729143"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72914-3_23","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-72914-3","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}