{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T09:06:34Z","timestamp":1743757594307,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T00:00:00Z","timestamp":1691625600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T00:00:00Z","timestamp":1691625600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100006502","name":"Defense Sciences Office, DARPA","doi-asserted-by":"publisher","award":["HR001123S0001-FP-004"],"award-info":[{"award-number":["HR001123S0001-FP-004"]}],"id":[{"id":"10.13039\/100006502","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10601-023-09351-6","type":"journal-article","created":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T06:03:48Z","timestamp":1691647428000},"page":"472-505","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Security-Aware Database Migration Planning"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5821-5117","authenticated-orcid":false,"given":"Utku Umur","family":"Acikalin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bugra","family":"Caskurlu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,10]]},"reference":[{"key":"9351_CR1","doi-asserted-by":"crossref","unstructured":"Acikalin, U.U., & Caskurlu, B. (2022). Multilevel memetic hypergraph partitioning with greedy recombination. In GECCO \u201922: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9 - 13, 2022, pp.\u00a0168\u2013171. ACM","DOI":"10.1145\/3520304.3529050"},{"key":"9351_CR2","doi-asserted-by":"crossref","unstructured":"Acikalin, U.U., Caskurlu, B., Wojciechowski, P., & Subramani, K. (2021). New results on test-cost minimization in database migration. In International Symposium on Algorithmic Aspects of Cloud Computing, pp.\u00a038\u201355, Springer","DOI":"10.1007\/978-3-030-93043-1_3"},{"issue":"20","key":"9351_CR3","doi-asserted-by":"publisher","first-page":"24","DOI":"10.3390\/bdcc5020024","volume":"5","author":"O Azeroual","year":"2021","unstructured":"Azeroual, O., & Jha, M. (2021). Without data quality, there is no data migration. Big Data and Cognitive Computing, 5(20), 24.","journal-title":"Big Data and Cognitive Computing"},{"key":"9351_CR4","unstructured":"Barhate, S., & Dhore, M. (2015). Data migration issues in cloud computing: a survey. International Journal of Electronics, Communication and Soft Computing Science & Engineering (IJECSCSE), 360"},{"issue":"3","key":"9351_CR5","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/s00453-013-9807-y","volume":"70","author":"J Chang","year":"2014","unstructured":"Chang, J., Gabow, H. N., & Khuller, S. (2014). A model for minimizing active processor time. Algorithmica, 70(3), 368\u2013405.","journal-title":"Algorithmica"},{"issue":"4","key":"9351_CR6","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/141356.141385","volume":"20","author":"A Chatterjee","year":"1991","unstructured":"Chatterjee, A., & Segev, A. (1991). Data manipulation in heterogeneous databases. SIGMOD Record, 20(4), 64\u201368.","journal-title":"SIGMOD Record"},{"issue":"2","key":"9351_CR7","first-page":"41","volume":"25","author":"HD Chon","year":"2002","unstructured":"Chon, H. D., Agrawal, D., & El Abbadi, A. (2002). Data management for moving objects. IEEE Data Eng. Bull., 25(2), 41\u201347.","journal-title":"IEEE Data Eng. Bull."},{"key":"9351_CR8","unstructured":"Chu, G., Stuckey, P.J., Schutt, A., Ehlers, T., Gange, G., & Francis, K. (2020). Chuffed, a lazy clause generation solver. https:\/\/github.com\/chuffed\/chuffed"},{"key":"9351_CR9","volume-title":"Introduction to Algorithms, Third Edition","author":"TH Cormen","year":"2009","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms, Third Edition (3rd ed.). The MIT Press.","edition":"3"},{"issue":"6","key":"9351_CR10","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1287\/opre.1120.1109","volume":"60","author":"M Dell\u2019Amico","year":"2012","unstructured":"Dell\u2019Amico, M., D\u00edaz, J. C. D., & Iori, M. (2012). The bin packing problem with precedence constraints. Operations Research, 60(6), 1491\u20131504.","journal-title":"Operations Research"},{"key":"9351_CR11","doi-asserted-by":"crossref","unstructured":"Drumm, C., Schmitt, M., Do, H.\u00a0H., & Rahm, E. (2007). Quickmig: automatic schema matching for data migration projects. In: Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, CIKM 2007, Lisbon, Portugal, November 6-10, 2007, pp.\u00a0107\u2013116","DOI":"10.1145\/1321440.1321458"},{"issue":"2","key":"9351_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.disopt.2010.11.001","volume":"8","author":"L Epstein","year":"2011","unstructured":"Epstein, L., Favrholdt, L. M., & Levin, A. (2011). Online variable-sized bin packing with conflicts. Discrete Optimization, 8(2), 333\u2013343.","journal-title":"Discrete Optimization"},{"issue":"1","key":"9351_CR13","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/060670328","volume":"38","author":"L Epstein","year":"2008","unstructured":"Epstein, L., & Levin, A. (2008). An aptas for generalized cost variable-sized bin packing. SIAM Journal on Computing, 38(1), 411\u2013428.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"9351_CR14","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.1137\/060666329","volume":"19","author":"L Epstein","year":"2008","unstructured":"Epstein, L., & Levin, A. (2008). On bin packing with conflicts. SIAM Journal on Optimization, 19(3), 1270\u20131298.","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"9351_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1367064.1367074","volume":"4","author":"G Even","year":"2008","unstructured":"Even, G., Levi, R., Rawitz, D., Schieber, B., Shahar, S., & Sviridenko, M. (2008). Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. ACM Transactions on Algorithms (TALG), 4(3), 1\u201317.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"issue":"1","key":"9351_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00226291","volume":"2","author":"E Falkenauer","year":"1996","unstructured":"Falkenauer, E. (1996). A hybrid grouping genetic algorithm for bin packing. Journal of heuristics, 2(1), 5\u201330.","journal-title":"Journal of heuristics"},{"key":"9351_CR17","doi-asserted-by":"crossref","unstructured":"Falkenauer, E., & Delchambre, A. (1992). A genetic algorithm for bin packing and line balancing. In: Proceedings of the 1992 IEEE International Conference on Robotics and Automation, Nice, France, May 12-14, 1992, IEEE Computer Society, pp.\u00a01186\u20131192","DOI":"10.1109\/ROBOT.1992.220088"},{"key":"9351_CR18","unstructured":"Ferrandina, F., Meyer, T., Zicari, R., Ferran, G., & Madec, J. (1995). Schema and database evolution in the O2 object database system. In: VLDB\u201995, Proceedings of 21th International Conference on Very Large Data Bases, September 11-15, 1995, Zurich, Switzerland, pp.\u00a0170\u2013181."},{"issue":"1","key":"9351_CR19","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"DK Friesen","year":"1986","unstructured":"Friesen, D. K., & Langston, M. A. (1986). Variable sized bin packing. SIAM journal on computing, 15(1), 222\u2013230.","journal-title":"SIAM journal on computing"},{"key":"9351_CR20","doi-asserted-by":"crossref","unstructured":"Gandhi, R., Halld\u00f3rsson, M.\u00a0M., Kortsarz, G., & Shachnai, H. (2004). Improved results for data migration and open shop scheduling. In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp.\u00a0658\u2013669","DOI":"10.1007\/978-3-540-27836-8_56"},{"issue":"1","key":"9351_CR21","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/s00453-007-9118-2","volume":"54","author":"R Gandhi","year":"2009","unstructured":"Gandhi, R., & Mestre, J. (2009). Combinatorial algorithms for data migration to minimize average completion time. Algorithmica, 54(1), 54\u201371.","journal-title":"Algorithmica"},{"key":"9351_CR22","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H: Freeman."},{"issue":"2","key":"9351_CR23","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/0210018","volume":"10","author":"MR Garey","year":"1981","unstructured":"Garey, M. R., Johnson, D. S., Simons, B. B., & Tarjan, R. E. (1981). Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM Journal on Computing, 10(2), 256\u2013269.","journal-title":"SIAM Journal on Computing"},{"key":"9351_CR24","unstructured":"Goldman, R., McHugh, J., & Widom, J. (1999). From semistructured data to XML: migrating the lore data model and query language. In: ACM SIGMOD Workshop on The Web and Databases, WebDB 1999, Philadelphia, Pennsylvania, USA, June 3-4, 1999. Informal Proceedings, pp.\u00a025\u201330"},{"key":"9351_CR25","doi-asserted-by":"crossref","unstructured":"Golubchik, L., Khuller, S., Kim, Y.\u00a0A., Shargorodskaya, S., & Wan, Y.\u00a0J. (2004). Data migration on parallel disks. In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp.\u00a0689\u2013701","DOI":"10.1007\/978-3-540-30140-0_61"},{"key":"9351_CR26","unstructured":"Hall, J., Hartline, J.\u00a0D., Karlin, A.\u00a0R., Saia, J., & Wilkes, J. (2001). On algorithms for efficient data migration. In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA, pp.\u00a0620\u2013629"},{"key":"9351_CR27","doi-asserted-by":"crossref","unstructured":"Hirofuchi, T., Ogawa, H., Nakada, H., Itoh, S., & Sekiguchi, S. (2009). A live storage migration mechanism over WAN for relocatable virtual machine services on clouds. In: 9th IEEE\/ACM International Symposium on Cluster Computing and the Grid, CCGrid 2009, Shanghai, China, 18-21 May 2009, pp.\u00a0460\u2013465.","DOI":"10.1109\/CCGRID.2009.44"},{"issue":"4","key":"9351_CR28","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/A:1009871302966","volume":"3","author":"K Jansen","year":"1999","unstructured":"Jansen, K. (1999). An approximation scheme for bin packing with conflicts. Journal of combinatorial optimization, 3(4), 363\u2013377.","journal-title":"Journal of combinatorial optimization"},{"key":"9351_CR29","doi-asserted-by":"crossref","unstructured":"Jensen, M., Schwenk, J., Gruschka, N., & Iacono, L.\u00a0L. (2009). On technical security issues in cloud computing. In: IEEE International Conference on Cloud Computing, CLOUD 2009, Bangalore, India, 21-25 September, 2009, pp.\u00a0109\u2013116","DOI":"10.1109\/CLOUD.2009.60"},{"key":"9351_CR30","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., & Karp, R.\u00a0M. (1982). An efficient approximation scheme for the one-dimensional bin-packing problem. In :23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), IEEE, pp.\u00a0312\u2013320","DOI":"10.1109\/SFCS.1982.61"},{"key":"9351_CR31","doi-asserted-by":"crossref","unstructured":"Kelarev, A., Seberry, J., Rylands, L., & Yi, X. (2017). Combinatorial algorithms and methods for security of statistical databases related to the work of mirka miller. In: Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers, pp.\u00a0383\u2013394","DOI":"10.1007\/978-3-319-78825-8_31"},{"key":"9351_CR32","doi-asserted-by":"crossref","unstructured":"Khuller, S., Kim, Y.\u00a0A., & Wan, Y.\u00a0J. (2003). Algorithms for data migration with cloning. In: Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA, pp.\u00a027\u201336","DOI":"10.1145\/773153.773156"},{"key":"9351_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107175","volume":"155","author":"Q Liu","year":"2021","unstructured":"Liu, Q., Cheng, H., Tian, T., Wang, Y., Leng, J., Zhao, R., Zhang, H., & Wei, L. (2021). Algorithms for the variable-sized bin packing problem with time windows. Computers & Industrial Engineering, 155, 107175.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"9351_CR34","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1147\/rd.471.0057","volume":"47","author":"R Lougee-Heimer","year":"2003","unstructured":"Lougee-Heimer, R. (2003). The common optimization interface for operations research: Promoting open-source software in the operations research community. IBM Journal of Research & Development, 47(1), 57\u201366.","journal-title":"IBM Journal of Research & Development"},{"key":"9351_CR35","doi-asserted-by":"crossref","unstructured":"Mens, T., Demeyer, S., Hainaut, J.-L., Cleve, A., Henrard, J., & Hick, J.-M. (2008). Migration of legacy information systems. Software Evolution, 105\u2013138.","DOI":"10.1007\/978-3-540-76440-3_6"},{"issue":"1","key":"9351_CR36","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/0216012","volume":"16","author":"FD Murgolo","year":"1987","unstructured":"Murgolo, F. D. (1987). An efficient approximation scheme for variable-sized bin packing. SIAM Journal on Computing, 16(1), 149\u2013161.","journal-title":"SIAM Journal on Computing"},{"key":"9351_CR37","doi-asserted-by":"crossref","unstructured":"Narayanan, D., Thereska, E., Donnelly, A., Elnikety, S., & Rowstron, A. I.\u00a0T. (2009). Migrating server storage to SSDs: analysis of tradeoffs. In: Proceedings of the 2009 EuroSys Conference, Nuremberg, Germany, April 1-3, 2009, pp.\u00a0145\u2013158","DOI":"10.1145\/1519065.1519081"},{"key":"9351_CR38","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P.\u00a0J., Becket, R., Brand, S., Duck, G.\u00a0J., & Tack, G. (2007). Minizinc: Towards a standard cp modelling language. In: Principles and Practice of Constraint Programming\u2013CP 2007: 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007. Proceedings 13, pp.\u00a0529\u2013543. Springer","DOI":"10.1007\/978-3-540-74970-7_38"},{"issue":"1","key":"9351_CR39","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ejor.2012.12.029","volume":"228","author":"A Otto","year":"2013","unstructured":"Otto, A., Otto, C., & Scholl, A. (2013). Systematic data generation & test design for solution algorithms on the example of salbpgen for assembly line balancing. European Journal of Operational Research, 228(1), 33\u201345.","journal-title":"European Journal of Operational Research"},{"key":"9351_CR40","unstructured":"Patil, S., Roy, S., Augustine, J., Redlich, A., Lodha, S., Vin, H.\u00a0M., Deshpande, A., Gharote, M.\u00a0S., & Mehrotra, A. (2010). Minimizing testing overheads in database migration lifecycle. In: COMAD, Citeseer, p.\u00a0191"},{"key":"9351_CR41","unstructured":"Perron, L., & Furnon, V. (2022) Or-tools. Google."},{"key":"9351_CR42","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.cor.2014.10.010","volume":"55","author":"M Quiroz-Castellanos","year":"2015","unstructured":"Quiroz-Castellanos, M., Cruz-Reyes, L., Torres-Jimenez, J., G\u00f3mez, C., Huacuja, H. J. F., & Alvim, A. C. (2015). A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Computers and Operations Research, 55, 52\u201364.","journal-title":"Computers and Operations Research"},{"key":"9351_CR43","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.cor.2014.10.010","volume":"55","author":"M Quiroz-Castellanos","year":"2015","unstructured":"Quiroz-Castellanos, M., Cruz Reyes, L., Torres-Jim\u00e9nez, J., Santill\u00e1n, C. G., Fraire Huacuja, H. J., & Alvim, A. C. F. (2015). A grouping genetic algorithm with controlled gene transmission for the bin packing problem. Computers & OR, 55, 52\u201364.","journal-title":"Computers & OR"},{"key":"9351_CR44","doi-asserted-by":"crossref","unstructured":"Saranya, N., Brindha, R., Aishwariya, N., Kokila, R., Matheswaran, P., & Poongavi, P. (2021). Data migration using etl workflow. In: 2021 7th International Conference on Advanced Computing & Communication Systems (ICACCS), vol.\u00a01, IEEE, pp.\u00a01661\u20131664","DOI":"10.1109\/ICACCS51430.2021.9441840"},{"issue":"7","key":"9351_CR45","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/S0305-0548(96)00082-2","volume":"24","author":"A Scholl","year":"1997","unstructured":"Scholl, A., Klein, R., & J\u00fcrgens, C. (1997). Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & OR, 24(7), 627\u2013645.","journal-title":"Computers & OR"},{"key":"9351_CR46","unstructured":"Schulte, C., Lagerkvist, M., & Tack, G. (2006). Gecode. Software download & online material at the website: http:\/\/www.gecode.org, 11\u201313"},{"key":"9351_CR47","doi-asserted-by":"crossref","unstructured":"Sianipar, J., Sukmana, M., & Meinel, C. (2018). Moving sensitive data against live memory dumping, spectre and meltdown attacks. In: 2018 26th International Conference on Systems Engineering (ICSEng), IEEE, pp.\u00a01\u20138","DOI":"10.1109\/ICSENG.2018.8638178"},{"issue":"4","key":"9351_CR48","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s00291-006-0071-2","volume":"29","author":"A Singh","year":"2007","unstructured":"Singh, A., & Gupta, A. K. (2007). Two heuristics for the one-dimensional bin-packing problem. OR Spectrum, 29(4), 765\u2013781.","journal-title":"OR Spectrum"},{"key":"9351_CR49","doi-asserted-by":"crossref","unstructured":"Subramani, K., Caskurlu, B., & Acikalin, U.\u00a0U. (2019). Security-aware database migration planning. In: International Symposium on Algorithmic Aspects of Cloud Computing, Springer, pp.\u00a0103\u2013121","DOI":"10.1007\/978-3-030-58628-7_7"},{"key":"9351_CR50","doi-asserted-by":"crossref","unstructured":"Subramani, K., Caskurlu, B., & Velasquez, A. (2018) Minimization of testing costs in capacity-constrained database migration. In: Algorithmic Aspects of Cloud Computing - 4th International Symposium, ALGOCLOUD 2018, Helsinki, Finland, August 20-21, 2018, Revised Selected Papers, pp.\u00a01\u201312.","DOI":"10.1007\/978-3-030-19759-9_1"},{"key":"9351_CR51","doi-asserted-by":"crossref","unstructured":"Syswerda, G. (1991) A study of reproduction in generational and steady-state genetic algorithms. In: Foundations of genetic algorithms, vol.\u00a01. Elsevier, pp.\u00a094\u2013101","DOI":"10.1016\/B978-0-08-050684-5.50009-4"},{"key":"9351_CR52","doi-asserted-by":"crossref","unstructured":"Wang, J., & Lochovsky, F.\u00a0H. (2003). Data extraction and label assignment for web databases. In Proceedings of the Twelfth International World Wide WebConference, WWW 2003, Budapest, Hungary, May 20-24, 2003, pp.\u00a0187\u2013196","DOI":"10.1145\/775152.775179"},{"issue":"2","key":"9351_CR53","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/0167-6377(82)90046-3","volume":"1","author":"T Wee","year":"1982","unstructured":"Wee, T., & Magazine, M. J. (1982). Assembly line balancing as generalized bin packing. Operations Research Letters, 1(2), 56\u201358.","journal-title":"Operations Research Letters"},{"key":"9351_CR54","doi-asserted-by":"crossref","unstructured":"Wojciechowski, P., Subramani, K., Velasquez, A., & Caskurlu, B. (2021). Algorithmic analysis of priority-based bin packing. In: Conference on Algorithms and Discrete Applied Mathematics, pp.\u00a0359\u2013372, Springer","DOI":"10.1007\/978-3-030-67899-9_29"},{"key":"9351_CR55","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.eswa.2016.07.023","volume":"64","author":"X Zhao","year":"2016","unstructured":"Zhao, X., Lin, Q., Chen, J., Wang, X., Yu, J., & Ming, Z. (2016). Optimizing security and quality of service in a real-time database system using multi-objective genetic algorithm. Expert Syst. Appl., 64, 11\u201323.","journal-title":"Expert Syst. Appl."},{"key":"9351_CR56","doi-asserted-by":"crossref","unstructured":"Zuckerman, D. (2006). Linear degree extractors and the inapproximability of max clique and chromatic number. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp.\u00a0681\u2013690","DOI":"10.1145\/1132516.1132612"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-023-09351-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-023-09351-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-023-09351-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,9]],"date-time":"2023-11-09T09:12:27Z","timestamp":1699521147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-023-09351-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,10]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["9351"],"URL":"https:\/\/doi.org\/10.1007\/s10601-023-09351-6","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2023,8,10]]},"assertion":[{"value":"13 June 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that we have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}