{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:51:44Z","timestamp":1725486704055},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679967"},{"type":"electronic","value":"9783540444367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44436-x_9","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T09:33:14Z","timestamp":1182159194000},"page":"72-83","source":"Crossref","is-referenced-by-count":0,"title":["Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Caprara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Mohan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Panconesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1006\/jcss.1997.1472","volume":"54","author":"S. Arora","year":"1997","unstructured":"S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness ofa pproximate optima in lattices, codes, and systems ofline ar equations. Journal of Computer and System Sciences, 54:317\u2013331, 1997.","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR2","unstructured":"R. D. Carr, S. Doddi, G. Konjevod, and M. Marathe. On the red-blue set cover problem. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 345\u2013353, 2000."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1109\/26.153361","volume":"40","author":"I. Chlamtac","year":"1992","unstructured":"I. Chlamtac, A. Ganz, and G. Karmi. Lightpath communications: an approach to high bandwidth optical WANs. IEEE Trans. on Communications, 40 (1992), 1171\u20131182.","journal-title":"IEEE Trans. on Communications"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Y. Dodis and S. Khanna. Designing networks with bounded pairwise distance. In Proc. ACM Symposium on Theory of Computing, pages 750\u2013759, 1999.","DOI":"10.1145\/301250.301447"},{"key":"9_CR5","unstructured":"J. H\u00e5stad. Clique is Hard to Approximate within n1-\u03b5. Accepted for publication in Acta Mathematica."},{"key":"9_CR6","unstructured":"J. H\u00e5stad. Some optimal inapproximability results. Manuscript."},{"key":"9_CR7","unstructured":"U. Feige and J. Kilian. Zero knowledge and the chromatic number. In Proc. IEEE Conference on Computational Complexity (formerly Structure in Complexity Theory), 1996."},{"key":"9_CR8","unstructured":"S. Khanna, M. Sudan, and L. Trevisan. Constraint satisfaction: The approximability of minimization problems. ECCC tech report TR96-064, available at http:\/\/www.eccc.uni-trier.de\/eccc-local\/Lists\/TR-1996.html . Also see: Proc. IEEE Conference on Computational Complexity (formerly Structure in Complexity Theory), pages 282\u2013296, 1997."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(98)00034-9","volume":"66","author":"S. O. Krumke","year":"1998","unstructured":"S. O. Krumke and H.-C. Wirth. On the minimum label spanning tree problem. Information Processing Letters, 66:81\u201385, 1998.","journal-title":"Information Processing Letters"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1109\/50.511623","volume":"14","author":"K. C. Lee","year":"1996","unstructured":"K. C. Lee and V. O. K. Li. A wavelength rerouting algorithm in wide-area alloptical networks. IEEE\/OSA Journal of Lightwave Technology, 14 (1996), 1218\u20131229.","journal-title":"IEEE\/OSA Journal of Lightwave Technology"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/S0140-3664(98)00239-4","volume":"22","author":"G. Mohan","year":"1999","unstructured":"G. Mohan and C. Siva Ram Murthy. Efficient algorithms for wavelength rerouting in WDM multi-fiber unidirectional ring networks. Computer Communications, 22 (1999), 232\u2013243.","journal-title":"Computer Communications"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/50.749380","volume":"17","author":"G. Mohan","year":"1999","unstructured":"G. Mohan and C. Siva Ram Murthy. A time optimal wavelength rerouting for dynamic traffic in WDM networks. IEEE\/OSA Journal of Lightwave Technology, 17 (1999), 406\u2013417.","journal-title":"IEEE\/OSA Journal of Lightwave Technology"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511814075"}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44436-X_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:55:13Z","timestamp":1556510113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44436-X_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679967","9783540444367"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44436-x_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}