{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:27:40Z","timestamp":1757618860440,"version":"3.44.0"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T00:00:00Z","timestamp":1752451200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T00:00:00Z","timestamp":1752451200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61832003, 62273322, 61972110 and U1811461"],"award-info":[{"award-number":["61832003, 62273322, 61972110 and U1811461"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Science and Technology Program","award":["JCYJ20220818100205012"],"award-info":[{"award-number":["JCYJ20220818100205012"]}]},{"name":"Shenzhen Key Laboratory of Intelligent Bioinformatics","award":["ZDSYS20220422103800001"],"award-info":[{"award-number":["ZDSYS20220422103800001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10878-025-01297-0","type":"journal-article","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T06:19:05Z","timestamp":1752473945000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardness and algorithms for several new optimization problems on the weighted massively parallel computation model"],"prefix":"10.1007","volume":"50","author":[{"given":"Hengzhao","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,14]]},"reference":[{"key":"1297_CR1","unstructured":"Afrati FN, Joglekar MR, Re CM, Salihoglu S, Ullman JD (2017) GYM: A multiround distributed join algorithm. Leibniz Int Proceed Inform, LIPIcs 68:4:1-4:18"},{"key":"1297_CR2","doi-asserted-by":"crossref","unstructured":"Afrati FN, Ullman JD (2010) Optimizing joins in a map-reduce environment. Advances in Database Technology - EDBT 2010\u201313th International Conference on Extending Database Technology, Proceedings. New York, USA, ACM Press, New York, pp. 99\u2013110","DOI":"10.1145\/1739041.1739056"},{"key":"1297_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal A, Alpern B, Chandra A, Snir M (1987) A model for hierarchical memory. In: Proceedings of the nineteenth annual ACM symposium on Theory of computing, pp. 305\u2013314","DOI":"10.1145\/28395.28428"},{"key":"1297_CR4","unstructured":"Ahmadi M, Kuhn F, Oshman R (2018) Distributed approximate maximum matching in the CONGEST model. In: Schmid Ulrich, Widder Josef (eds) 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15\u201319, 2018, volume 121 of LIPIcs, pp. 6:1\u20136:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"1297_CR5","doi-asserted-by":"crossref","unstructured":"Akg\u00fcl M (1992) The linear assignment problem. In: Combinatorial optimization. Springer, pp. 85\u2013122","DOI":"10.1007\/978-3-642-77489-8_5"},{"issue":"2","key":"1297_CR6","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BF01185206","volume":"12","author":"B Alpern","year":"1994","unstructured":"Alpern B, Carter L, Feig E, Selker T (1994) The uniform memory hierarchy model of computation. Algorithmica 12(2):72\u2013109","journal-title":"Algorithmica"},{"issue":"5","key":"1297_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3106412","volume":"64","author":"TJ Ameloot","year":"2017","unstructured":"Ameloot TJ, Geck G, Ketsman B, Neven F, Schwentick T (2017) Parallel-correctness and transferability for conjunctive queries. J ACM (JACM) 64(5):1\u201338","journal-title":"J ACM (JACM)"},{"key":"#cr-split#-1297_CR8.1","unstructured":"Alexandr A, Aleksandar N, Krzysztof O, Grigory Y (2014) Parallel algorithms for geometric graph problems. In: Shmoys David B"},{"key":"#cr-split#-1297_CR8.2","unstructured":"(ed) Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014. ACM, pp 574-583"},{"key":"1297_CR9","unstructured":"Andr\u00e1s F, Eberhard T, Bernhard K, Jens V (1998) On the bipartite travelling salesman problem. Technical report, Citeseer"},{"key":"1297_CR10","doi-asserted-by":"crossref","unstructured":"Beame P, Koutris P, Suciu D (2013) Communication steps for parallel query processing. In: Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, volume 64, pp. 273\u2013284, New York, New York, USA, ACM Press","DOI":"10.1145\/2463664.2465224"},{"key":"1297_CR11","doi-asserted-by":"crossref","unstructured":"Beame P, Koutris P, Suciu D (2014) Skew in parallel query processing. In: Proceedings of the ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems. Association for Computing Machinery, pp. 212\u2013223","DOI":"10.1145\/2594538.2594558"},{"key":"1297_CR12","unstructured":"Blanas S (2020) Topology-aware parallel data processing : models , Algorithms and Systems at Scale. In: 10th Annual conference on innovative data systems research (CIDR \u201820), 2020"},{"issue":"3\u20134","key":"1297_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/rsa.10004","volume":"19","author":"C Borgs","year":"2001","unstructured":"Borgs C, Chayes J, Pittel B (2001) Phase transition and finite-size scaling for the integer partitioning problem. Random Struct Algorith 19(3\u20134):247\u2013288","journal-title":"Random Struct Algorith"},{"key":"1297_CR14","doi-asserted-by":"crossref","unstructured":"Burkard RE, Cela E (1999) Linear assignment problems and extensions. In Handbook of combinatorial optimization. Springer, pp. 75\u2013149","DOI":"10.1007\/978-1-4757-3023-4_2"},{"key":"1297_CR15","unstructured":"Censor-Hillel K, Khoury S, Paz A (2017) Quadratic and near-quadratic lower bounds for the CONGEST model. In: Richa AW, (eds), 31st International Symposium on Distributed Computing, DISC 2017, October 16\u201320, 2017, Vienna, Austria, volume 91 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 10:1\u201310:16"},{"key":"1297_CR16","doi-asserted-by":"crossref","unstructured":"Chang YJ, Fischer M, Ghaffari M, Uitto J, Zheng Y (2019) The complexity of ($$\\delta $$+ 1) coloring in congested clique, massively parallel computation, and centralized local computation. In: Proceedings of the 2019 ACM symposium on principles of distributed computing, pp. 471\u2013480","DOI":"10.1145\/3293611.3331607"},{"key":"1297_CR17","doi-asserted-by":"crossref","unstructured":"Chen Y, Flum J, Grohe M (2003) Bounded nondeterminism and alternation in parameterized complexity theory. In: 18th IEEE Annual conference on computational complexity, 2003. Proceedings. IEEE, pp. 13\u201329","DOI":"10.1109\/CCC.2003.1214407"},{"key":"1297_CR18","doi-asserted-by":"crossref","unstructured":"Cheng L, Li T (2016) Efficient data redistribution to speedup big data analytics in large systems. In: 23rd IEEE International Conference on High Performance Computing, HiPC 2016, Hyderabad, India. IEEE Computer Society, December 19\u201322, pp. 91\u2013100","DOI":"10.1109\/HiPC.2016.020"},{"issue":"3","key":"1297_CR19","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/TKDE.2002.1000339","volume":"14","author":"DW-L Cheung","year":"2002","unstructured":"Cheung DW-L, Lee SD, Xiao Y (2002) Effect of data skewness and workload balance in parallel data mining. IEEE Trans Knowl Data Eng 14(3):498\u2013514","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"11","key":"1297_CR20","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/240455.240477","volume":"39","author":"DE Culler","year":"1996","unstructured":"Culler DE, Karp RM, Patterson D, Sahay A, Santos EE, Schauser KE, Subramonian R, von Eicken T (1996) LogP A practical model of parallel computation. Commun ACM 39(11):78\u201385","journal-title":"Commun ACM"},{"issue":"1","key":"1297_CR21","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) MapReduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"1297_CR22","doi-asserted-by":"crossref","unstructured":"Dory M, Fischer O, Khoury S, Leitersdorf D (2021) Constant-round spanners and shortest paths in congested clique and MPC. In: Proceedings of the 2021 ACM symposium on principles of distributed computing, pp. 223\u2013233","DOI":"10.1145\/3465084.3467928"},{"issue":"4","key":"1297_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3527213","volume":"69","author":"M Dory","year":"2022","unstructured":"Dory M, Parter M (2022) Exponentially faster shortest paths in the congested clique. ACM J ACM (JACM) 69(4):1\u201342","journal-title":"ACM J ACM (JACM)"},{"issue":"2","key":"1297_CR24","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/2.44900","volume":"23","author":"R Duncan","year":"1990","unstructured":"Duncan R (1990) A survey of parallel computer architectures. Computer 23(2):5\u201316","journal-title":"Computer"},{"key":"1297_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114500","volume":"996","author":"P Fraigniaud","year":"2024","unstructured":"Fraigniaud P, Luce M, Todinca I (2024) On the power of threshold-based algorithms for detecting cycles in the congest model. Theoret Comput Sci 996:114500","journal-title":"Theoret Comput Sci"},{"key":"1297_CR26","unstructured":"Fran\u00e7ois\u00a0LG (2016) Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems. In Gavoille C, Ilcinkas D, (eds), Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings, volume 9888 of Lecture Notes in Computer Science. Springer, pp 57\u201370"},{"issue":"3","key":"1297_CR27","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey MR, Johnson DS (1978) \u201cstrong\" np-completeness results: Motivation, examples, and implications. J ACM (JACM) 25(3):499\u2013508","journal-title":"J ACM (JACM)"},{"issue":"3","key":"1297_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3329120","volume":"20","author":"G Geck","year":"2019","unstructured":"Geck G, Ketsman B, Neven F, Schwentick T (2019) Parallel-correctness and containment for conjunctive queries with union and negation. ACM Trans Comput Logic (TOCL) 20(3):1\u201324","journal-title":"ACM Trans Comput Logic (TOCL)"},{"key":"1297_CR29","doi-asserted-by":"crossref","unstructured":"Ghaffari M, Gouleakis T, Konrad C, Mitrovi\u0107 S, Rubinfeld R (2018) Improved massively parallel computation algorithms for MIS, matching, and vertex cover. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pages 129\u2013138, New York, NY, USA, jul 2018. ACM","DOI":"10.1145\/3212734.3212743"},{"key":"1297_CR30","doi-asserted-by":"crossref","unstructured":"Ghaffari M, Kuhn F(2013) Distributed minimum cut approximation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 8205 LNCS, pp. 1\u201315","DOI":"10.1007\/978-3-642-41527-2_1"},{"key":"1297_CR31","doi-asserted-by":"crossref","unstructured":"Ghaffari M, Parter M (2016) MST in log-star rounds of congested clique. In Giakkoupis G, editor, Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016, pages 19\u201328. ACM","DOI":"10.1145\/2933057.2933103"},{"key":"1297_CR32","unstructured":"Gonen T, Oshman R (2017) Lower bounds for subgraph detection in the CONGEST model. In: James A, Alysson B, Pascal F, Jo\u00e3o L (eds) 21st International conference on principles of distributed systems, OPODIS 2017, Lisbon, Portugal, December 18\u201320, 2017, Volume 95 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp 6:1\u20136:16"},{"key":"1297_CR33","doi-asserted-by":"crossref","unstructured":"Haeupler B, Wajc D, Zuzic G (2021) Universally-optimal distributed algorithms for known topologies. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1166\u20131179","DOI":"10.1145\/3406325.3451081"},{"key":"1297_CR34","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson MM, Kuhn F, Maus Y, Tonoyan T (2021) Efficient randomized distributed coloring in congest. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1180\u20131193","DOI":"10.1145\/3406325.3451089"},{"issue":"2","key":"1297_CR35","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/176979.176984","volume":"26","author":"TJ Harris","year":"1994","unstructured":"Harris TJ (1994) A survey of pram simulation techniques. ACM Comput Surv (CSUR) 26(2):187\u2013206","journal-title":"ACM Comput Surv (CSUR)"},{"key":"1297_CR36","doi-asserted-by":"crossref","unstructured":"Hartmanis J (1982) Computers and intractability: a guide to the theory of np-completeness (michael r. garey and david s. johnson). SIAM Rev 24(1):90","DOI":"10.1137\/1024022"},{"key":"1297_CR37","unstructured":"Holzer S, Pinsker N (2015) Approximation of distances and shortest paths in the broadcast congest clique. In: Anceaume E, Cachin C, Potop-Butucaru MG, (eds), 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14-17, 2015, Rennes, France, volume\u00a046 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik pp. 6:1\u20136:16"},{"issue":"2","key":"1297_CR38","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/3651598","volume":"2","author":"X Hu","year":"2024","unstructured":"Hu X, Koutris P (2024) Topology-aware parallel joins. Proc ACM Manag Data 2(2):97","journal-title":"Proc ACM Manag Data"},{"key":"1297_CR39","doi-asserted-by":"crossref","unstructured":"Hu X, Koutris P, Blanas S (2021) Algorithms for a topology-aware massively parallel computation model. In: Proceedings of the ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems. Association for computing machinery, June 2021, pp. 199\u2013214","DOI":"10.1145\/3452021.3458318"},{"issue":"1","key":"1297_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3633512","volume":"71","author":"X Hu","year":"2024","unstructured":"Hu X, Tao Y (2024) Parallel acyclic joins: optimal algorithms and cyclicity separation. J ACM 71(1):1\u201344","journal-title":"J ACM"},{"key":"1297_CR41","unstructured":"Howard K, Suri S, Vssilvitskii S (2010) A model of computation for MapReduce. In: Proceedings of the Annual ACM-SIAM symposium on discrete algorithms, Philadelphia, PA, Jan 2010. Society for Industrial and Applied Mathematics, pp. 938\u2013948"},{"key":"1297_CR42","unstructured":"Karmarkar N, Karp RM (1982) The differencing method of set partitioning. Computer Science Division (EECS), University of California Berkeley"},{"key":"1297_CR43","unstructured":"Karp RM (1988) A survey of parallel algorithms for shared-memory machines"},{"key":"1297_CR44","unstructured":"Ketsman B, Neven F, Vandevoort B (2018) Parallel-correctness and transferability for conjunctive queries under bag semantics. In: 21st International Conference on Database Theory (ICDT 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"issue":"6","key":"1297_CR45","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/TPDS.2002.1011416","volume":"13","author":"J Knoop","year":"2002","unstructured":"Knoop J, Mehofer E (2002) Distribution assignment placement: Effective optimization of redistribution costs. IEEE Trans Parallel Distrib Syst 13(6):628\u2013647","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"10\u201311","key":"1297_CR46","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1016\/0167-8191(94)90060-4","volume":"20","author":"O Kolp","year":"1994","unstructured":"Kolp O (1994) Performance estimation for a parallel system with a hierarchical switch network. Parallel Comput 20(10\u201311):1613\u20131626","journal-title":"Parallel Comput"},{"key":"1297_CR47","unstructured":"Koutris P, Beame P, Suciu D (2016) Worst-case optimal algorithms for parallel query processing. In Leibniz International Proceedings in Informatics, LIPIcs, volume 48. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Mar 2016"},{"key":"1297_CR48","doi-asserted-by":"crossref","unstructured":"Koutris P, Suciu D(2011) Parallel evaluation of conjunctive queries. In: Lenzerini M, Schwentick T, (eds), Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, June 12\u201316, 2011, Athens, Greece. ACM, pp. 223\u2013234","DOI":"10.1145\/1989284.1989310"},{"key":"1297_CR49","doi-asserted-by":"crossref","unstructured":"Koutris P, Salihoglu S, Suciu D (2018) Algorithmic aspects of parallel query processing. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 1659\u20131664. Association for Computing Machinery, may 2018","DOI":"10.1145\/3183713.3197388"},{"key":"1297_CR50","unstructured":"Kurkal R (2009) Data redistribution problem in data intensive sensor networks. PhD thesis, Wichita State University"},{"key":"1297_CR51","doi-asserted-by":"crossref","unstructured":"Lattanzi S, Moseley B, Suri S, Vassilvitskii S (2011) Filtering: a method for solving graph problems in MapReduce. Annual ACM Symposium on Parallelism in Algorithms and Architectures. New York, USA, ACM Press, New York, pp 85\u201394","DOI":"10.1145\/1989493.1989505"},{"key":"1297_CR52","doi-asserted-by":"crossref","unstructured":"Lee C, Chang ZA (1993) Workload balance and page access scheduling for parallel joins in shared-nothing systems. In: Proceedings of the Ninth International Conference on Data Engineering, April 19\u201323, 1993, Vienna, Austria. IEEE Computer Society, pp. 411\u2013418","DOI":"10.1109\/ICDE.1993.344040"},{"issue":"1","key":"1297_CR53","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/10637199608915543","volume":"8","author":"Z Li","year":"1996","unstructured":"Li Z, Mills P, Reif JH (1996) Models and resource metrics for parallel and distributed computation. Parallel Algorithms Appl 8(1):35\u201359","journal-title":"Parallel Algorithms Appl"},{"issue":"2","key":"1297_CR54","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola EM, Maia NM, de Abreu P, Netto OB, Hahn P, Querido TM (2007) A survey for the quadratic assignment problem. Eur J Oper Res 176(2):657\u2013690","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1297_CR55","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/(SICI)1098-2418(199801)12:1<51::AID-RSA3>3.0.CO;2-S","volume":"12","author":"GS Lueker","year":"1998","unstructured":"Lueker GS (1998) Exponentially small bounds on the expected optimum of the partition and subset sum problems. Random Struct Algorith 12(1):51\u201362","journal-title":"Random Struct Algorith"},{"issue":"1","key":"1297_CR56","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/71.262585","volume":"5","author":"QM Malluhi","year":"1994","unstructured":"Malluhi QM, Bayoumi MA (1994) The hierarchical hypercube: A new interconnection topology for massively parallel systems. IEEE Trans Parallel Distrib Syst 5(1):17\u201330","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1297_CR57","doi-asserted-by":"crossref","unstructured":"Martello S, Toth P (1987) Linear assignment problems. In North-Holland Mathematics Studies, vol 132, Elsevier, pp 259\u2013282","DOI":"10.1016\/S0304-0208(08)73238-9"},{"issue":"20","key":"1297_CR58","doi-asserted-by":"publisher","first-page":"4281","DOI":"10.1103\/PhysRevLett.81.4281","volume":"81","author":"S Mertens","year":"1998","unstructured":"Mertens S (1998) Phase transition in the number partitioning problem. Phys Rev Lett 81(20):4281","journal-title":"Phys Rev Lett"},{"key":"1297_CR59","unstructured":"Mertens S (2006) Number partitioning. Computational complexity and statistical physics, p. 125"},{"key":"1297_CR60","unstructured":"Neven F, Schwentick T, Spinrath C, Vandevoort B (2019) Parallel-correctness and parallel-boundedness for datalog programs. In: 22nd International Conference on Database Theory (ICDT 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"key":"1297_CR61","doi-asserted-by":"crossref","unstructured":"Nowicki K (2021) A deterministic algorithm for the Mst problem in constant rounds of congested clique. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1154\u20131165","DOI":"10.1145\/3406325.3451136"},{"key":"1297_CR62","unstructured":"O\u2019malley O (2008) Terabyte sort on apache hadoop. Yahoo, available online at: http:\/\/sortbenchmark.org\/Yahoo-Hadoop.pdf, (May), pp. 1\u20133"},{"key":"1297_CR63","doi-asserted-by":"crossref","unstructured":"Peleg D (2000) Distributed computing: a locality-sensitive approach. SIAM","DOI":"10.1137\/1.9780898719772"},{"issue":"3","key":"1297_CR64","first-page":"230","volume":"21","author":"M Pfund","year":"2004","unstructured":"Pfund M, Fowler JW, Gupta J (2004) A survey of algorithms for single and multi-objective unrelated parallel-machine deterministic scheduling problems. J Chinese Instit Ind Eng 21(3):230\u2013241","journal-title":"J Chinese Instit Ind Eng"},{"key":"1297_CR65","doi-asserted-by":"crossref","unstructured":"Polychroniou O, Sen R, Ross KA (2014) Track join: distributed joins with minimal network traffic. In: Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pp. 1483\u20131494","DOI":"10.1145\/2588555.2610521"},{"issue":"2","key":"1297_CR66","doi-asserted-by":"publisher","first-page":"101","DOI":"10.3126\/jist.v20i2.13961","volume":"20","author":"PS Pundir","year":"2015","unstructured":"Pundir PS, Porwal SK, Singh BP (2015) A new algorithm for solving linear bottleneck assignment problem. J Instit Sci Technology 20(2):101\u2013102","journal-title":"J Instit Sci Technology"},{"key":"1297_CR67","doi-asserted-by":"crossref","unstructured":"Qiao X, Chen S, Yang LT (2004) HPM: a hierarchical model for parallel computations. Int J High Perform Comput Netw 1(\/2\/3):117\u2013127","DOI":"10.1504\/IJHPCN.2004.007571"},{"issue":"5","key":"1297_CR68","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6377(86)90007-6","volume":"4","author":"M Queyranne","year":"1986","unstructured":"Queyranne M (1986) Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems. Oper Res Lett 4(5):231\u2013234","journal-title":"Oper Res Lett"},{"key":"1297_CR69","doi-asserted-by":"crossref","unstructured":"R\u00f6diger W, M\u00fchlbauer T, Unterbrunner P, Reiser A, Kemper A, Neumann T (2014) Locality-sensitive operators for parallel main-memory database clusters. In: 2014 IEEE 30th International conference on data engineering. IEEE, pp. 592\u2013603","DOI":"10.1109\/ICDE.2014.6816684"},{"key":"1297_CR70","doi-asserted-by":"crossref","unstructured":"Rozho\u0148 V, Grunau C, Haeupler B, Zuzic G, Li J (2022) Undirected (1+eps)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pp. 478\u2013487","DOI":"10.1145\/3519935.3520074"},{"issue":"6","key":"1297_CR71","doi-asserted-by":"publisher","first-page":"804","DOI":"10.20965\/ijat.2021.p0804","volume":"15","author":"T Shimada","year":"2021","unstructured":"Shimada T, Suwa H (2021) Optimization of cutting tool allocation to enhance workload balance and total completion time in parallel-type FMS. Int J Autom Technol 15(6):804\u2013812","journal-title":"Int J Autom Technol"},{"key":"1297_CR72","doi-asserted-by":"crossref","unstructured":"Tao Y, Lin W, Xiao X (2013) Minimal MapReduce algorithms. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, number June, New York, New York, USA, ACM Press, pp. 529\u2013540","DOI":"10.1145\/2463676.2463719"},{"issue":"8","key":"1297_CR73","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant LG (1990) A bridging model for parallel computation. Commun ACM 33(8):103\u2013111","journal-title":"Commun ACM"},{"key":"1297_CR74","doi-asserted-by":"crossref","unstructured":"van Apeldoorn J, de Vos Tijn (2022) A framework for distributed quantum queries in the congest model. In: Proceedings of the 2022 ACM symposium on principles of distributed computing, pp. 109\u2013119","DOI":"10.1145\/3519270.3538413"},{"issue":"1","key":"1297_CR75","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1287\/moor.21.1.85","volume":"21","author":"B Yakir","year":"1996","unstructured":"Yakir B (1996) The differencing algorithm LDM for partitioning: a proof of a conjecture of karmarkar and karp. Math Oper Res 21(1):85\u201399","journal-title":"Math Oper Res"},{"issue":"12","key":"1297_CR76","first-page":"1660","volume":"26","author":"Y-Q Zhang","year":"2003","unstructured":"Zhang Y-Q (2003) Dram (h): A parallel computation model for high performance numerical computing. Chinese J Comput-Chinese Edition 26(12):1660\u20131670","journal-title":"Chinese J Comput-Chinese Edition"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01297-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-025-01297-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-025-01297-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T10:10:04Z","timestamp":1757239804000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-025-01297-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,14]]},"references-count":77,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["1297"],"URL":"https:\/\/doi.org\/10.1007\/s10878-025-01297-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2025,7,14]]},"assertion":[{"value":"29 March 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"7"}}