{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:49Z","timestamp":1725541849356},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_22","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T13:12:27Z","timestamp":1259845947000},"page":"250-261","source":"Crossref","is-referenced-by-count":1,"title":["Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph"],"prefix":"10.1007","author":[{"given":"Zhentao","family":"Li","sequence":"first","affiliation":[]},{"given":"Ignasi","family":"Sau","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/PL00007233","volume":"17","author":"N. Alon","year":"2001","unstructured":"Alon, N., Teague, V., Wormald, N.C.: Linear Arboricity and Linear k-Arboricity of Regular Graphs. Graphs and Combinatorics\u00a017(1), 11\u201316 (2001)","journal-title":"Graphs and Combinatorics"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-540-77120-3_49","volume-title":"Algorithms and Computation","author":"O. Amini","year":"2007","unstructured":"Amini, O., P\u00e9rennes, S., Sau, I.: Hardness and Approximation of Traffic Grooming. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 561\u2013573. Springer, Heidelberg (2007)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Bermond, J.-C., Coudert, D.: Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory. In: IEEE ICC, vol.\u00a02, pp. 1402\u20131406 (2003)","DOI":"10.1109\/ICC.2003.1204621"},{"key":"22_CR4","series-title":"Discrete Mathematics and its Applications","first-page":"493","volume-title":"The CRC Handbook of Combinatorial Designs, ch. VI.27","author":"J.-C. Bermond","year":"2006","unstructured":"Bermond, J.-C., Coudert, D.: Grooming. In: Colbourn, C.J., Dinitz, J.H. (eds.) The CRC Handbook of Combinatorial Designs, ch. VI.27, 2nd edn. Discrete Mathematics and its Applications, vol.\u00a042, pp. 493\u2013496. CRC Press, Boca Raton (2006)","edition":"2"},{"issue":"2-3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0012-365X(84)90075-X","volume":"52","author":"J.-C. Bermond","year":"1984","unstructured":"Bermond, J.-C., Fouquet, J.-L., Habib, M., P\u00e9roche, B.: On linear k-arboricity. Discrete Mathematics\u00a052(2-3), 123\u2013132 (1984)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1137\/S0895480101387893","volume":"16","author":"L.S. Chandran","year":"2003","unstructured":"Chandran, L.S.: A high girth graph construction. SIAM J. Discrete Math.\u00a016(3), 366\u2013370 (2003)","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"22_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":"22_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":"22_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"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/net.10054","volume":"41","author":"O. Goldschmidt","year":"2003","unstructured":"Goldschmidt, O., Hochbaum, D., Levin, A., Olinick, E.: The SONET edge-partition problem. Networks\u00a041(1), 13\u201323 (2003)","journal-title":"Networks"},{"issue":"7","key":"22_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/35.933446","volume":"39","author":"E. Modiano","year":"2001","unstructured":"Modiano, E., Lin, P.: Traffic grooming in WDM networks. IEEE Communications Magazine\u00a039(7), 124\u2013129 (2001)","journal-title":"IEEE Communications Magazine"},{"key":"22_CR12","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":"22_CR13","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J.P. Petersen","year":"1891","unstructured":"Petersen, J.P.: Die Theorie der Regul\u00e4ren Graphs. Acta Mathematica\u00a015, 193\u2013220 (1891)","journal-title":"Acta Mathematica"},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1006\/jctb.1998.1868","volume":"75","author":"C. Thomassen","year":"1999","unstructured":"Thomassen, C.: Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5. J. Comb. Theory Ser. B\u00a075(1), 100\u2013109 (1999)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"22_CR15","first-page":"55","volume":"4","author":"K. Zhu","year":"2003","unstructured":"Zhu, K., Mukherjee, B.: A review of traffic grooming in WDM optical networks: Architectures and challenges. Optical Networks Magazine\u00a04(2), 55\u201364 (2003)","journal-title":"Optical Networks Magazine"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11409-0_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:52:02Z","timestamp":1619783522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}