{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:10:05Z","timestamp":1740103805241,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,3,4]],"date-time":"2017-03-04T00:00:00Z","timestamp":1488585600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10951-017-0514-4","type":"journal-article","created":{"date-parts":[[2017,3,4]],"date-time":"2017-03-04T07:59:04Z","timestamp":1488614344000},"page":"327-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Flexible bandwidth assignment with application to optical networks"],"prefix":"10.1007","volume":"21","author":[{"given":"Hadas","family":"Shachnai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3544-9014","authenticated-orcid":false,"given":"Ariella","family":"Voloshin","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":[[2017,3,4]]},"reference":[{"issue":"1","key":"514_CR1","first-page":"10","volume":"11","author":"AZ Ali\u00a0Norouzi","year":"2011","unstructured":"Ali\u00a0Norouzi, A. Z., & Ustundag, B. B. (2011). An integrated survey in optical networks: Concepts, components and problems. International Journal of Computer Science and Network Security, 11(1), 10\u201326.","journal-title":"International Journal of Computer Science and Network Security"},{"issue":"3","key":"514_CR2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V Bafna","year":"1999","unstructured":"Bafna, V., Berman, P., & Fujito, T. (1999). A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal on Discrete Mathematics, 12(3), 289\u2013297.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"514_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N., Chakrabarti, A., Epstein, A., & Schieber, B. (2006). A quasi-PTAS for unsplittable flow on line graphs. In: Proceedings of the 38th annual ACM symposium on theory of computing (STOC) (pp. 721\u2013729).","DOI":"10.1145\/1132516.1132617"},{"issue":"5","key":"514_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., & Schieber, B. (2001). A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 48(5), 1069\u20131090.","journal-title":"Journal of the ACM"},{"key":"514_CR5","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda, R. (2000). One for the price of two: A unified approach for approximating covering problems. Algorithmica, 27(2), 131\u2013144.","DOI":"10.1007\/s004530010009"},{"issue":"1","key":"514_CR6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s00453-007-9121-7","volume":"54","author":"R Bar-Yehuda","year":"2009","unstructured":"Bar-Yehuda, R., Beder, M., Cohen, Y., & Rawitz, D. (2009). Resource allocation in bounded degree trees. Algorithmica, 54(1), 89\u2013106.","journal-title":"Algorithmica"},{"key":"514_CR7","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda, R., & Even, S. (1985). A local-ratio theorem for approximating the weighted vertex cover problem. In Analysis and design of algorithms for combinatorial problems. North-Holland mathematics studies (vol. 109, pp. 27\u201345). North-Holland.","DOI":"10.1016\/S0304-0208(08)73101-3"},{"issue":"4","key":"514_CR8","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1145\/2000807.2000816","volume":"7","author":"G C\u0103linescu","year":"2011","unstructured":"C\u0103linescu, G., Chakrabarti, A., Karloff, H. J., & Rabani, Y. (2011). An improved approximation algorithm for resource allocation. ACM Transactions on Algorithms, 7(4), 48.","journal-title":"ACM Transactions on Algorithms"},{"key":"514_CR9","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Mydlarz, M., & Shepherd, F. B. (2007). Multicommodity demand flow in a tree and packing integer programs. ACM Transaction on Algorithms\n                    3(3).","DOI":"10.1145\/1273340.1273343"},{"issue":"5","key":"514_CR10","first-page":"501","volume":"34","author":"B Chen","year":"2002","unstructured":"Chen, B., Hassin, R., & Tzur, M. (2002). Allocation of bandwidth and storage. IIE Transactions, 34(5), 501\u2013507.","journal-title":"IIE Transactions"},{"issue":"4","key":"514_CR11","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1007\/s00453-011-9502-9","volume":"63","author":"M Chrobak","year":"2012","unstructured":"Chrobak, M., Woeginger, G. J., Makino, K., & Xu, H. (2012). Caching is hard\u2014Even in the fault model. Algorithmica, 63(4), 781\u2013794.","journal-title":"Algorithmica"},{"key":"514_CR12","volume-title":"Computers and Intractability. A guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. S. (1979). Computers and Intractability. A guide to the theory of NP-completeness. San Francisco: Freeman."},{"key":"514_CR13","doi-asserted-by":"crossref","unstructured":"Gerstel, O. (2010). Flexible use of spectrum and photonic grooming. In Integrated photonics research, silicon and nanophotonics and photonics in switching (p. PMD3).","DOI":"10.1364\/PS.2010.PMD3"},{"key":"514_CR14","doi-asserted-by":"crossref","unstructured":"Gerstel, O. (2011). Realistic approaches to scaling the ip network using optics. In Optical fiber communication conference and exposition and the national fiber optic engineers conference (p. OWP1).","DOI":"10.1364\/OFC.2011.OWP1"},{"key":"514_CR15","volume-title":"Algorithmic graph theory and perfect graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M. C. (1980). Algorithmic graph theory and perfect graphs. New York: Academic Press."},{"issue":"11","key":"514_CR16","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/MCOM.2009.5307468","volume":"47","author":"M Jinno","year":"2009","unstructured":"Jinno, M., Takara, H., Kozicki, B., Tsukishima, Y., Sone, Y., & Matsuoka, S. (2009). Spectrum-efficient and scalable elastic optical path network: Architecture, benefits, and enabling technologies. IEEE Communications Magazine, 47(11), 66\u201373.","journal-title":"IEEE Communications Magazine"},{"key":"514_CR17","doi-asserted-by":"crossref","unstructured":"Katz, D., Schieber, B., & Shachnai, H. (2016). Brief announcement: Flexible resource allocation for clouds and all-optical networks. In proceedings of the 28th ACM symposium on parallelism in algorithms and architectures (SPAA) (pp. 225\u2013226).","DOI":"10.1145\/2935764.2935806"},{"key":"514_CR18","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Marchetti-Spaccamela, A., & Vitaletti, A. (2000). Approximation algorithms for bandwidth and storage allocation problems under real time constraints. In proceedings of the 20th conference on foundations of software technology and theoretical computer science (pp. 409\u2013420).","DOI":"10.1007\/3-540-44450-5_33"},{"key":"514_CR19","doi-asserted-by":"crossref","unstructured":"M\u00f6mke, T., & Wiese, A. (2015). A (\n                        $$2+\\epsilon $$\n                        \n                            \n                                \n                                    2\n                                    +\n                                    \u03f5\n                                \n                            \n                        \n                    )-approximation algorithm for the storage allocation problem. In proceedings of the 42nd international colloquium on automata, languages, and programming (ICALP) (pp. 973\u2013984).","DOI":"10.1007\/978-3-662-47672-7_79"},{"key":"514_CR20","volume-title":"Optical networks: A practical perspective","author":"R Ramaswami","year":"2009","unstructured":"Ramaswami, R., Sivarajan, K., & Sasaki, G. (2009). Optical networks: A practical perspective (3rd ed.). Los Altos: Morgan Kaufmann.","edition":"3"},{"key":"514_CR21","doi-asserted-by":"crossref","unstructured":"Shachnai, H., Voloshin, A., & Zaks, S. (2014) Optimizing bandwidth allocation in flex-grid optical networks with application to scheduling. In Proceedings of the 28th IEEE international parallel and distributed processing symposium (IPDPS) (pp. 862\u2013871).","DOI":"10.1109\/IPDPS.2014.93"},{"key":"514_CR22","doi-asserted-by":"crossref","unstructured":"Shalom, M., Wong, P. W. H., & Zaks, S. (2013). Profit maximization in flex-grid all-optical networks. In Proceedings of the 20th international colloquium on structural information and communication complexity (SIROCCO) (pp. 249\u2013260). Berlin: Springer.","DOI":"10.1007\/978-3-319-03578-9_21"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-017-0514-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0514-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-017-0514-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T07:02:50Z","timestamp":1527577370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-017-0514-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,4]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["514"],"URL":"https:\/\/doi.org\/10.1007\/s10951-017-0514-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2017,3,4]]}}}