{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:11:37Z","timestamp":1725570697590},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176524"},{"type":"electronic","value":"9783642176531"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17653-1_32","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T05:50:47Z","timestamp":1291614647000},"page":"443-458","source":"Crossref","is-referenced-by-count":6,"title":["Optimizing Regenerator Cost in Traffic Grooming"],"prefix":"10.1007","author":[{"given":"Michele","family":"Flammini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianpiero","family":"Monaco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Moscardelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mordechai","family":"Shalom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shmuel","family":"Zaks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"32_CR1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.20366","volume":"55","author":"S. Chen","year":"2010","unstructured":"Chen, S., Ljubic, I., Raghavan, S.: The regenerator location problem. Networks\u00a055(3), 205\u2013220 (2010)","journal-title":"Networks"},{"issue":"4","key":"32_CR2","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1137\/S0097539792229507","volume":"26","author":"D. Dor","year":"1997","unstructured":"Dor, D., Tarsi, M.: Graph decomposition is np-complete: A complete proof of holyer\u2019s conjecture. SIAM Journal on Computing\u00a026(4), 1166\u20131187 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canad. J. Math.\u00a017, 449\u2013467 (1965)","journal-title":"Canad. J. Math."},{"key":"32_CR4","unstructured":"Fedrizzi, R., Galimberti, G.M., Gerstel, O., Martinelli, G., Salvadori, E., Saradhi, C.V., Tanzi, A., Zanardi, A.: A Framework for Regenerator Site Selection Based on Multiple Paths. In: Prooceedings of IEEE\/OSA Conference on Optical Fiber Communications (OFC) (to appear, 2010)"},{"key":"32_CR5","unstructured":"Fedrizzi, R., Galimberti, G.M., Gerstel, O., Martinelli, G., Salvadori, E., Saradhi, C.V., Tanzi, A., Zanardi, A.: Traffic Independent Heuristics for Regenerator Site Selection for Providing Any-to-Any Optical Connectivity. In: Proceedings of IEEE\/OSA Conference on Optical Fiber Communications (OFC) (to appear, 2010)"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Flammini, M., Marchetti-Spaccamela, A., Monaco, G., Moscardelli, L., Zaks, S.: On the complexity of the regenerator placement problem in optical networks. IEEE\/ACM Transactions on Networking (to appear, 2010)","DOI":"10.1145\/1583991.1584035"},{"issue":"40-42","key":"32_CR7","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":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1007\/978-3-540-85451-7_99","volume-title":"Euro-Par 2008 Parallel Processing","author":"M. Flammini","year":"2008","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the traffic grooming problem with respect to adms and oadms. In: Luque, E., Margalef, T., Ben\u00edtez, D. (eds.) Euro-Par 2008. LNCS, vol.\u00a05168, pp. 920\u2013929. Springer, Heidelberg (2008)"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Optimizing regenerator cost in traffic grooming. Technical report, Faculty of Computer Science, Technion (September 2010), http:\/\/www.cs.technion.ac.il\/users\/wwwb\/cgi-bin\/tr-info.cgi\/2010\/CS\/CS-2010-16","DOI":"10.1007\/978-3-642-17653-1_32"},{"issue":"1","key":"32_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1049\/ip-com:20010064","volume":"148","author":"S.W. Kim","year":"2001","unstructured":"Kim, S.W., Seo, S.W.: Regenerator placement algorithms for connection establishment in all-optical networks. IEE Proceedings Communications\u00a0148(1), 25\u201330 (2001)","journal-title":"IEE Proceedings Communications"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/978-3-642-14162-1_28","volume-title":"ICALP 2010","author":"G.B. Mertzios","year":"2010","unstructured":"Mertzios, G.B., Sau, I., Shalom, M., Zaks, S.: Placing regenerator in optical networks: New model, hardness results and algorithms. In: Gavoille, C. (ed.) ICALP 2010, Part II. LNCS, vol.\u00a06199, pp. 333\u2013344. Springer, Heidelberg (2010)"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Pachnicke, S., Paschenda, T., Krummrich, P.M.: Physical Impairment Based Regenerator Placement and Routing in Translucent Optical Networks. In: Optical Fiber Communication Conference and Exposition and The National Fiber Optic Engineers Conference (Optical Society of America, paper OWA2) (2008)","DOI":"10.1109\/OFC.2008.4528659"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Sriram, K., Griffith, D., Su, R., Golmie, N.: Static vs. dynamic regenerator assignment in optical switches: models and cost trade-offs. In: Workshop on High Performance Switching and Routing (HPSR), pp. 151\u2013155 (2004)","DOI":"10.1109\/HPSR.2004.1303453"},{"key":"32_CR14","unstructured":"Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: SODA, pp. 830\u2013831 (2003)"},{"key":"32_CR15","unstructured":"Yang, X., Ramamurthy, B.: Dynamic routing in translucent WDM optical networks. In: Proceedings of the IEEE International Conference on Communications (ICC), pp. 955\u2013971 (2002)"},{"issue":"1","key":"32_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s11107-005-1694-y","volume":"10","author":"X. Yang","year":"2005","unstructured":"Yang, X., Ramamurthy, B.: Sparse Regeneration in Translucent Wavelength-Routed Optical Networks: Architecture, Network Design and Wavelength Routing. Photonic Network Communications\u00a010(1), 39\u201353 (2005)","journal-title":"Photonic Network Communications"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17653-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T20:24:18Z","timestamp":1712003058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17653-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176524","9783642176531"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17653-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}