{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T07:51:44Z","timestamp":1746777104241,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031185298"},{"type":"electronic","value":"9783031185304"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-18530-4_24","type":"book-chapter","created":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T23:02:30Z","timestamp":1668985350000},"page":"324-335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Polynomial-Time Approximation Schemes for\u00a0a\u00a0Class of\u00a0Integrated Network Design and\u00a0Scheduling Problems with\u00a0Parallel Identical Machines"],"prefix":"10.1007","author":[{"given":"Yusuke","family":"Saito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akiyoshi","family":"Shioura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,21]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1080\/0740817X.2011.636792","volume":"44","author":"I Averbakh","year":"2012","unstructured":"Averbakh, I., Pereira, J.: The flowtime network construction problem. IIE Trans. 44, 681\u2013694 (2012)","journal-title":"IIE Trans."},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/j.ejor.2015.02.014","volume":"244","author":"I Averbakh","year":"2015","unstructured":"Averbakh, I., Pereira, J.: Network construction problems with due dates. Eur. J. Oper. Res. 244, 715\u2013729 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. SIAM J. Discret. Math. 13, 64\u201378 (2000)","journal-title":"SIAM J. Discret. Math."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.ejor.2014.04.018","volume":"238","author":"M Baxter","year":"2014","unstructured":"Baxter, M., Elgindy, T., Ernst, A.T., Kalinowski, T., Savelsbergh, M.W.P.: Incremental network design with shortest paths. Eur. J. Oper. Res. 238, 675\u2013684 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10107-009-0307-4","volume":"128","author":"A Berger","year":"2011","unstructured":"Berger, A., Bonifaci, V., Grandoni, F., Sch\u00e4fer, G.: Budgeted matching and budgeted matroid intersection via the gasoline puzzle. Math. Program. 128, 355\u2013372 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0307-4","journal-title":"Math. Program."},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35, 713\u2013728 (2005)","journal-title":"SIAM J. Comput."},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"417","DOI":"10.7155\/jgaa.00423","volume":"21","author":"K Engel","year":"2017","unstructured":"Engel, K., Kalinowski, T., Savelsbergh, M.W.P.: Incremental network design problem with minimum spanning trees. J. Graph Algorithms Appl. 21, 417\u2013432 (2017)","journal-title":"J. Graph Algorithms Appl."},{"key":"24_CR8","unstructured":"Goemans, M.X., Unda, F.: Approximating incremental combinatorial optimization problems. In: Proceedings of APPROX\/RANDOM, LIPIcs, vol. 81, pp. 6:1\u20136:14 (2017)"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17, 36\u201342 (1992)","journal-title":"Math. Oper. Res."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.ejor.2014.10.003","volume":"242","author":"T Kalinowski","year":"2015","unstructured":"Kalinowski, T., Matsypura, D., Savelsbergh, M.W.P.: Incremental network design with maximum flows. Eur. J. Oper. Res. 242, 51\u201362 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-48413-4_6","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"H Kellerer","year":"1999","unstructured":"Kellerer, H.: A polynomial time approximation scheme for the multiple knapsack problem. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) APPROX\/RANDOM -1999. LNCS, vol. 1671, pp. 51\u201362. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48413-4_6"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.3390\/math8010133","volume":"8","author":"X Liu","year":"2020","unstructured":"Liu, X., Li, W.: Approximation algorithm for the single machine scheduling problem with release dates and submodular rejection penalty. Mathematics 8, 133 (2020)","journal-title":"Mathematics"},{"issue":"6","key":"24_CR13","doi-asserted-by":"publisher","first-page":"2165","DOI":"10.1007\/s11590-021-01724-1","volume":"15","author":"X Liu","year":"2021","unstructured":"Liu, X., Li, W.: Approximation algorithms for the multiprocessor scheduling with submodular penalties. Optim. Lett. 15(6), 2165\u20132180 (2021). https:\/\/doi.org\/10.1007\/s11590-021-01724-1","journal-title":"Optim. Lett."},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1016\/j.ejor.2012.07.010","volume":"223","author":"SG Nurre","year":"2012","unstructured":"Nurre, S.G., Cavdaroglu, B., Mitchell, J.E., Sharkey, T.C., Wallace, W.A.: Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem. Eur. J. Oper. Res. 223, 794\u2013806 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1002\/net.21547","volume":"63","author":"SG Nurre","year":"2014","unstructured":"Nurre, S.G., Sharkey, T.C.: Integrated network design and scheduling problems with parallel identical machines: complexity and dispatching rules. Networks 63, 303\u2013326 (2014)","journal-title":"Networks"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-61422-2_121","volume-title":"Algorithm Theory \u2014 SWAT\u201996","author":"R Ravi","year":"1996","unstructured":"Ravi, R., Goemans, M.X.: The constrained minimum spanning tree problem. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 66\u201375. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61422-2_121"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay, D., Gaspar, N., Kaspi, M.: A survey on offline scheduling with rejection. J. Sched. 16, 3\u201328 (2013). https:\/\/doi.org\/10.1007\/s10951-012-0303-z","journal-title":"J. Sched."},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Wang, T., Averbakh, I.: Network construction\/restoration problems: cycles and complexity. J. Comb. Optim. (2021, published online)","DOI":"10.1007\/s10878-021-00813-2"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Zheng, H., Gao, S., Liu, W., Wu, W., Du, D.-Z., Hou, B.: Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties. J. Comb. Optim. (2022, published online)","DOI":"10.1007\/s10878-021-00842-x"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18530-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T23:04:08Z","timestamp":1668985448000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18530-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031185298","9783031185304"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18530-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isco2022.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}