{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:53:07Z","timestamp":1725583987512},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_25","type":"book-chapter","created":{"date-parts":[[2013,5,20]],"date-time":"2013-05-20T20:43:48Z","timestamp":1369082628000},"page":"241-249","source":"Crossref","is-referenced-by-count":0,"title":["A Cost-Efficient Scheduling Algorithm for Traffic Grooming"],"prefix":"10.1007","author":[{"given":"Xianrong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenhong","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minxian","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Andrews, M., Zhang, L.: Bounds on fiber minimization in optical networks with fixed fiber capacity. In: Proceedings of IEEE INFOCOM 2005, Miami, FL (March 2005)","DOI":"10.1109\/INFCOM.2005.1497910"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1109\/TNET.2009.2014226","volume":"17","author":"M. Andrews","year":"2009","unstructured":"Andrews, M., Zhang, L.: Complexity of wavelength assignment in optical network optimization. IEEE\/ACM Transactions on Networking\u00a017(2), 646\u2013657 (2009)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"25_CR3","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2007","unstructured":"Brucker, P.: Scheduling Algorithms, 5th edn. Springer, Heidelberg (2007)","edition":"5"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the traffic grooming problem with respect to adms and oadms. In: 14th International European Conference on Parallel and Distributed Computing (EuroPar), Las Palmas de Gran Canaria, Spain, August 26-29 (2008)","DOI":"10.1007\/978-3-540-85451-7_99"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Optimizing Regenerator Cost in Traffic Groomings. Technical Report (July 2011)","DOI":"10.1007\/978-3-642-17653-1_32"},{"issue":"40-42","key":"25_CR6","doi-asserted-by":"publisher","first-page":"3553","DOI":"10.1016\/j.tcs.2010.05.011","volume":"411","author":"M. Flammini","year":"2010","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shachnai, H., Shalom, M., Tamir, T., Zaks, S.: Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks. Theoretical Computer Science\u00a0411(40-42), 3553\u20133562 (2010)","journal-title":"Theoretical Computer Science"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Kani, J., Shimazu, S., Yoshimoto, N., Hadama, H.: Energy-Efficient Optical Access Network Technologies. In: The Proceedings of OFC 2011 (2011)","DOI":"10.1364\/OFC.2011.OThB1"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Kilper, D.: Energy-Efficient Networks. In: The Proceedings of OFC 2011 (2011)","DOI":"10.1364\/OFC.2011.OWI5"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Pachnicke, S., Paschendaand, T., Krummrich, P.M.: Physical Impairment Based Regenerator Placement and Routing in Translucent Optical Networks. In: The Proceedings of OFC-NFOEC 2008 (2008)","DOI":"10.1109\/OFC.2008.4528659"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-642-29952-0_43","volume-title":"Theory and Applications of Models of Computation","author":"M. Shalom","year":"2012","unstructured":"Shalom, M., Voloshin, A., Wong, P.W.H., Yung, F.C.C., Zaks, S.: Online Optimization of Busy Time on Parallel Machines. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol.\u00a07287, pp. 448\u2013460. Springer, Heidelberg (2012)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Tian, W.: A Dynamic Modeling And Dimensioning Approach For Optical Networks. In: 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006, October 1-5 (2006)","DOI":"10.1109\/BROADNETS.2006.4374314"},{"key":"25_CR12","unstructured":"Tian, W.H.: Modeling approaches and provisioning algorithms for dynamic bandwidth adjustment in multi-media networks. In: 2009 HONET, International Symposium on High Capacity Optical Networks and Enabling Technologies (2009)"},{"key":"25_CR13","unstructured":"Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: SODA, pp. 830-831 (2003)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T20:12:08Z","timestamp":1563048728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}