{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T15:54:00Z","timestamp":1720799640772},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T00:00:00Z","timestamp":1349222400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s00453-012-9693-8","type":"journal-article","created":{"date-parts":[[2012,10,2]],"date-time":"2012-10-02T15:36:48Z","timestamp":1349192208000},"page":"671-691","source":"Crossref","is-referenced-by-count":3,"title":["On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming"],"prefix":"10.1007","volume":"68","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","published-online":{"date-parts":[[2012,10,3]]},"reference":[{"issue":"38\u201340","key":"9693_CR1","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 410(38\u201340), 3751\u20133760 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9693_CR2","volume-title":"Complexity and Approximation, Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation, Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)"},{"issue":"3","key":"9693_CR3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.20366","volume":"55","author":"S. Chen","year":"2010","unstructured":"Chen, S., Ljubi\u0107, I., Raghavan, S.: The regenerator location problem. Networks 55(3), 205\u2013220 (2010)","journal-title":"Networks"},{"key":"9693_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A greedy heuristic for the set covering problem. Math. Oper. Res. 4, 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9693_CR5","doi-asserted-by":"crossref","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 J. Sel. Areas Commun. 20(1), 183\u2013189 (2002)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"1\u20132","key":"9693_CR6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0304-3975(01)00101-3","volume":"276","author":"G. C\u0103linescu","year":"2002","unstructured":"C\u0103linescu, G., Wan, P.-J.: Splitable traffic partition in WDM\/SONET rings to minimize sonet ADMs. Theor. Comput. Sci. 276(1\u20132), 33\u201350 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9693_CR7","doi-asserted-by":"crossref","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. J.\u00a0Comb. Optim. 6(4), 425\u2013453 (2002)","journal-title":"J.\u00a0Comb. Optim."},{"key":"9693_CR8","first-page":"1","volume-title":"Proceedings of Conference on Optical Fiber Communications (OFC)","author":"C.V. Saradhi","year":"2010","unstructured":"Saradhi, C.V., Zanardi, A., Fedrizzi, R., Salvadori, E., Galimberti, G.M., Tanzi, A., Martinelli, G., Gerstel, O.: A framework for regenerator site selection based on multiple paths. In: Proceedings of Conference on Optical Fiber Communications (OFC), pp. 1\u20133. IEEE Press, New York (2010)"},{"issue":"2","key":"9693_CR9","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/TNET.2010.2068309","volume":"19","author":"M. Flammini","year":"2011","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 Trans. Netw. 19(2), 498\u2013511 (2011)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"40\u201342","key":"9693_CR10","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 411(40\u201342), 3553\u20133562 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"9693_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1007\/978-3-540-85451-7_99","volume-title":"Proceedings of International European Conference on Parallel and Distributed Computing (EURO-PAR)","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: Proceedings of International European Conference on Parallel and Distributed Computing (EURO-PAR). Lecture Notes in Computer Science, vol. 5168, pp. 920\u2013929. Springer, Berlin (2008)"},{"issue":"52","key":"9693_CR12","doi-asserted-by":"crossref","first-page":"7109","DOI":"10.1016\/j.tcs.2011.09.023","volume":"412","author":"M. Flammini","year":"2011","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Optimizing regenerator cost in traffic grooming. Theor. Comput. Sci. 412(52), 7109\u20137121 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"9693_CR13","first-page":"69","volume-title":"Proceedings of International Conference on Computer Communications (INFOCOM)","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: Proceedings of International Conference on Computer Communications (INFOCOM), pp. 69\u201377. IEEE Press, Providence (1998)"},{"key":"9693_CR14","first-page":"169","volume-title":"Proceedings of Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)","author":"R. Khandekar","year":"2010","unstructured":"Khandekar, R., Schieber, B., Shachnai, H., Tamir, T.: Minimizing busy time in multiple machine real-time scheduling. In: Proceedings of Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Schloss Dagstuhl, pp. 169\u2013180 (2010)"},{"key":"9693_CR15","author":"G.B. Mertzios","year":"2012","unstructured":"Mertzios, G.B., Sau, I., Shalom, M., Zaks, S.: Placing regenerators in optical networks to satisfy multiple sets of requests. IEEE\/ACM Trans. Netw. (2012). doi: 10.1109\/TNET.2012.2186462","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9693_CR16","first-page":"151","volume-title":"Proceedings of Workshop on High Performance Switching and Routing (HPSR)","author":"K. Sriram","year":"2004","unstructured":"Sriram, K., Griffith, D., Su, R., Golmie, N.: Static vs. dynamic regenerator assignment in optical switches: models and cost trade-offs. In: Proceedings of Workshop on High Performance Switching and Routing (HPSR), pp. 151\u2013155. IEEE Press, New York (2004)"},{"key":"9693_CR17","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2004","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2004)"},{"key":"9693_CR18","first-page":"830","volume-title":"Proceedings of Symposium on Discrete Algorithms (SODA)","author":"P. Winkler","year":"2003","unstructured":"Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: Proceedings of Symposium on Discrete Algorithms (SODA), pp. 830\u2013831. ACM\u2013SIAM, New York (2003)"},{"issue":"1","key":"9693_CR19","doi-asserted-by":"crossref","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 Netw. Commun. 10(1), 39\u201353 (2005)","journal-title":"Photonic Netw. Commun."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9693-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9693-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9693-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T23:45:35Z","timestamp":1714434335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9693-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,3]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["9693"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9693-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,3]]}}}