{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:31:07Z","timestamp":1725557467838},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642132834"},{"type":"electronic","value":"9783642132841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13284-1_5","type":"book-chapter","created":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T03:43:53Z","timestamp":1275709433000},"page":"41-56","source":"Crossref","is-referenced-by-count":0,"title":["Traffic Grooming in Star Networks via Matching Techniques"],"prefix":"10.1007","author":[{"given":"Ignasi","family":"Sau","sequence":"first","affiliation":[]},{"given":"Mordechai","family":"Shalom","sequence":"additional","affiliation":[]},{"given":"Shmuel","family":"Zaks","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"38-40","key":"5_CR1","doi-asserted-by":"publisher","first-page":"3751","DOI":"10.1016\/j.tcs.2009.04.028","volume":"410","author":"O. Amini","year":"2009","unstructured":"Amini, O., P\u00e9rennes, S., Sau, I.: Hardness and Approximation of Traffic Grooming. Theoretical Computer Science\u00a0410(38-40), 3751\u20133760 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"2-3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.tcs.2007.04.028","volume":"384","author":"J.-C. Bermond","year":"2007","unstructured":"Bermond, J.-C., Braud, L., Coudert, D.: Traffic grooming on the path. Theoretical Computer Science\u00a0384(2-3), 139\u2013151 (2007)","journal-title":"Theoretical Computer Science"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1109\/49.57798","volume":"8","author":"C.A. Brackett","year":"1990","unstructured":"Brackett, C.A.: Dense wavelength division multiplexing networks: principles and applications. IEEE Journal on Selected Areas in Communications\u00a08, 948\u2013964 (1990)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1002\/net.20029","volume":"44","author":"T. Chow","year":"2004","unstructured":"Chow, T., Lin, P.: The ring grooming problem. Networks\u00a044(3), 194\u2013202 (2004)","journal-title":"Networks"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Chung, N.K., Nosu, K., Winzer, G.: Special issue on dense wdm networks. IEEE Journal on Selected Areas in Communications\u00a08 (1990)","DOI":"10.1109\/49.57828"},{"key":"5_CR6","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, vol.\u00a0173. Springer, Heidelberg (2005)"},{"issue":"6","key":"5_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/MNET.2002.1081765","volume":"16","author":"R. Dutta","year":"2002","unstructured":"Dutta, R., Rouskas, N.: Traffic grooming in WDM networks: Past and future. IEEE Network\u00a016(6), 46\u201356 (2002)","journal-title":"IEEE Network"},{"issue":"7","key":"5_CR8","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1016\/j.jpdc.2008.01.003","volume":"68","author":"M. Flammini","year":"2008","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the Traffic Grooming Problem in Tree and Star Networks. Journal of Parallel and Distributed Computing\u00a068(7), 939\u2013948 (2008)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.jda.2007.09.001","volume":"6","author":"M. Flammini","year":"2008","unstructured":"Flammini, M., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the Traffic Grooming Problem. Journal of Discrete Algorithms\u00a06(3), 472\u2013479 (2008)","journal-title":"Journal of Discrete Algorithms"},{"key":"5_CR10","volume-title":"Numbers, Information and Complexity","author":"L. Gargano","year":"2000","unstructured":"Gargano, L., Vaccaro, U.: Routing in All\u2013Optical Networks: Algorithmic and Graph-Theoretic Problems. In: Numbers, Information and Complexity. Kluwer Academic, Dordrecht (2000)"},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/JSAC.2006.1613773","volume":"24","author":"S. Huang","year":"2006","unstructured":"Huang, S., Dutta, R., Rouskas, G.: 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":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-11409-0_22","volume-title":"Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)","author":"Z. Li","year":"2009","unstructured":"Li, Z., Sau, I.: Graph Partitioning and Traffic Groomingwith Bounded Degree Request Graph. In: Paul, C. (ed.) WG 2009. LNCS, vol.\u00a05911, pp. 250\u2013261. Springer, Heidelberg (2009)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-540-92248-3_27","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"X. Mu\u00f1oz","year":"2008","unstructured":"Mu\u00f1oz, X., Sau, I.: Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, pp. 300\u2013311. Springer, Heidelberg (2008)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Pulleyblank, R.: Faces of Matching Polyhedra. PhD thesis, University of Waterloo (1973)","DOI":"10.1007\/BFb0066196"},{"key":"5_CR15","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"issue":"2","key":"5_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","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13284-1_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:03:58Z","timestamp":1606169038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13284-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642132834","9783642132841"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13284-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}