{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:43:08Z","timestamp":1729669388850,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ipdps.2003.1213409","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T09:34:28Z","timestamp":1079948068000},"page":"8","source":"Crossref","is-referenced-by-count":0,"title":["Multicasting to groups in optical networks and related combinatorial optimization problems"],"prefix":"10.1109","author":[{"given":"L.","family":"Gargano","sequence":"first","affiliation":[]},{"given":"A.A.","family":"Rescigno","sequence":"additional","affiliation":[]},{"given":"U.","family":"Vaccaro","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Multiwavelength Optical Networks","year":"1999","author":"sterne","key":"ref31"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-52292-1_14","article-title":"Beyond steiner's problem: A vlsi oriented generalization","volume":"411","author":"reich","year":"1990","journal-title":"Proceedings of Graph-Theoretic Concepts in Computer Science"},{"key":"ref10","first-page":"13","article-title":"Scheduling of virtual connections in fast networks","author":"erlebach","year":"1996","journal-title":"Proc of Parallel Systems and Algorithms (PASA)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MS.1985.230701"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BFb0120689","article-title":"Two computationally difficult set covering problems that arise in computing the 1&#x2013;width incidence matrices of steiner triple systems","volume":"2","author":"fulkerson","year":"1974","journal-title":"Math Progr Stud"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01864160"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1096"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.10002"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_31"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6048-4_45"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200101)37:1<8::AID-NET2>3.0.CO;2-R"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195119"},{"journal-title":"Graphs","year":"1991","author":"berge","key":"ref4"},{"journal-title":"Optical Communication Networks","year":"1997","author":"mukherjee","key":"ref27"},{"key":"ref3","article-title":"Graph problems arising from wavelength-routing in all-optical networks","author":"beauquier","year":"1997","journal-title":"Proc WOCS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276719"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258641"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00018-8"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0927-0507(05)80106-9","article-title":"Time constrained routing and scheduling","volume":"8","author":"desrosiers","year":"0","journal-title":"Handbooks in Operations Research and Mangement Science"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/303849.303865"},{"key":"ref2","first-page":"567","article-title":"Improved bounds for all optical routing","author":"aumann","year":"1995","journal-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/49.564128"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/235809.235812"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/43.541449"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/90.234851"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90058-8"},{"key":"ref23","first-page":"437","article-title":"Improved access to optical bandwidth","author":"kumar","year":"1997","journal-title":"Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492585"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.25.12.1175"}],"event":{"name":"International Parallel and Distributed Processing Symposium (IPDPS 2003)","acronym":"IPDPS-03","location":"Nice, France"},"container-title":["Proceedings International Parallel and Distributed Processing Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8608\/27277\/01213409.pdf?arnumber=1213409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T14:57:28Z","timestamp":1585666648000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1213409\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2003.1213409","relation":{},"subject":[]}}