{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T11:44:43Z","timestamp":1775648683886,"version":"3.50.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030581145","type":"print"},{"value":"9783030581152","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58115-2_47","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:02:51Z","timestamp":1598997771000},"page":"675-685","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Filter Sort Is $$\\varOmega (N^3)$$ in the Worst Case"],"prefix":"10.1007","author":[{"given":"Sumit","family":"Mishra","sequence":"first","affiliation":[]},{"given":"Maxim","family":"Buzdalov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"47_CR1","unstructured":"Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of 17th International Conference on Data Engineering, pp. 421\u2013430. IEEE (2001)"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Buzdalov, M.: Generalized offline orthant search: one code for many problems in multiobjective optimization. In: Proceedings of Genetic and Evolutionary Computation Conference, pp. 593\u2013600. ACM (2018)","DOI":"10.1145\/3205455.3205469"},{"key":"47_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-030-12598-1_6","volume-title":"Evolutionary Multi-Criterion Optimization","author":"M Buzdalov","year":"2019","unstructured":"Buzdalov, M.: Make evolutionary multiobjective algorithms scale better with advanced data structures: van emde boas tree for non-dominated sorting. In: Deb, K., et al. (eds.) EMO 2019. LNCS, vol. 11411, pp. 66\u201377. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12598-1_6"},{"key":"47_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-319-10762-2_52","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"M Buzdalov","year":"2014","unstructured":"Buzdalov, M., Shalyto, A.: A provably asymptotically fast version of the generalized Jensen algorithm for non-dominated sorting. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 528\u2013537. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_52"},{"key":"47_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44719-9_9","volume-title":"Evolutionary Multi-Criterion Optimization","author":"CA Coello Coello Coello","year":"2001","unstructured":"Coello Coello Coello, C.A., Toscano Pulido, G.: A micro-genetic algorithm for multiobjective optimization. In: Zitzler, E., Thiele, L., Deb, K., Coello Coello, C.A., Corne, D. (eds.) EMO 2001. LNCS, vol. 1993, pp. 126\u2013140. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44719-9_9"},{"key":"47_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/3-540-45356-3_82","volume-title":"Parallel Problem Solving from Nature PPSN VI","author":"DW Corne","year":"2000","unstructured":"Corne, D.W., Knowles, J.D., Oates, M.J.: The pareto envelope-based selection algorithm for multiobjective optimization. In: Schoenauer, M., et al. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 839\u2013848. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45356-3_82"},{"key":"47_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-319-54157-0_12","volume-title":"Evolutionary Multi-Criterion Optimization","author":"K Deb","year":"2017","unstructured":"Deb, K., Hussein, R., Roy, P., Toscano, G.: Classifying metamodeling methods for evolutionary multi-objective optimization: first results. In: Trautmann, H., et al. (eds.) EMO 2017. LNCS, vol. 10173, pp. 160\u2013175. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-54157-0_12"},{"issue":"4","key":"47_CR8","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577\u2013601 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"47_CR9","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"47_CR10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1162\/evco_a_00204","volume":"26","author":"P Gustavsson","year":"2018","unstructured":"Gustavsson, P., Syberfeldt, A.: A new algorithm using the non-dominated tree to improve non-dominated sorting. Evol. Comput. 26(1), 89\u2013116 (2018)","journal-title":"Evol. Comput."},{"key":"47_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-540-31880-4_38","volume-title":"Evolutionary Multi-Criterion Optimization","author":"J Handl","year":"2005","unstructured":"Handl, J., Knowles, J.: Exploiting the trade-off \u2014 the benefits of multiple objectives in data clustering. In: Coello Coello, C.A., Hern\u00e1ndez Aguirre, A., Zitzler, E. (eds.) EMO 2005. LNCS, vol. 3410, pp. 547\u2013560. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4_38"},{"issue":"5","key":"47_CR12","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TEVC.2003.817234","volume":"7","author":"MT Jensen","year":"2003","unstructured":"Jensen, M.T.: Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms. IEEE Trans. Evol. Comput. 7(5), 503\u2013515 (2003)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"Knowles, J., Corne, D.: M-PAES: a memetic algorithm for multiobjective optimization. In: Proceedings of IEEE Congress on Evolutionary Computation, vol. 1, pp. 325\u2013332. IEEE (2000)","DOI":"10.1109\/CEC.2000.870313"},{"issue":"2","key":"47_CR14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"JD Knowles","year":"2000","unstructured":"Knowles, J.D., Corne, D.W.: Approximating the nondominated front using the Pareto archived evolution strategy. Evol. Comput. 8(2), 149\u2013172 (2000)","journal-title":"Evol. Comput."},{"issue":"4","key":"47_CR15","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/321906.321910","volume":"22","author":"HT Kung","year":"1975","unstructured":"Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. J. ACM 22(4), 469\u2013476 (1975)","journal-title":"J. ACM"},{"issue":"1","key":"47_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2200\/S00108ED1V01Y200802AIM003","volume":"2","author":"K Leyton-Brown","year":"2008","unstructured":"Leyton-Brown, K., Shoham, Y.: Essentials of game theory: a concise multidisciplinary introduction. Synthesis Lect. Artif. Intell. Mach. Learn. 2(1), 1\u201388 (2008)","journal-title":"Synthesis Lect. Artif. Intell. Mach. Learn."},{"issue":"5","key":"47_CR17","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1137\/0222060","volume":"22","author":"RD Lou","year":"1993","unstructured":"Lou, R.D., Sarrafzadeh, M.: An optimal algorithm for the maximum three-chain problem. SIAM J. Comput. 22(5), 976\u2013993 (1993)","journal-title":"SIAM J. Comput."},{"key":"47_CR18","doi-asserted-by":"crossref","unstructured":"Markina, M., Buzdalov, M.: Hybridizing non-dominated sorting algorithms: divide-and-conquer meets best order sort. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 153\u2013154. ACM (2017)","DOI":"10.1145\/3067695.3076074"},{"key":"47_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-319-99253-2_28","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"M Markina","year":"2018","unstructured":"Markina, M., Buzdalov, M.: Towards large-scale multiobjective optimisation with a hybrid algorithm for non-dominated sorting. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 347\u2013358. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_28"},{"issue":"1","key":"47_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/EVCO_a_00041","volume":"20","author":"K McClymont","year":"2012","unstructured":"McClymont, K., Keedwell, E.: Deductive sort and climbing sort: new methods for non-dominated sorting. Evol. Comput. 20(1), 1\u201326 (2012)","journal-title":"Evol. Comput."},{"key":"47_CR21","doi-asserted-by":"publisher","unstructured":"Mishra, S., Buzdalov, M.: If unsure, shuffle: deductive sort is $$\\varTheta (MN^3)$$, but $$O(MN^2)$$ in expectation over input permutations. In: Proceedings of Genetic and Evolutionary Computation Conference. ACM (2020). https:\/\/doi.org\/10.1145\/3377930.3390246 . Accepted for publication","DOI":"10.1145\/3377930.3390246"},{"key":"47_CR22","doi-asserted-by":"publisher","unstructured":"Mishra, S., Buzdalov, M., Senwar, R.: Time complexity analysis of the dominance degree approach for non-dominated sorting. In: Proceedings of Genetic and Evolutionary Computation Conference Companion. ACM (2020). https:\/\/doi.org\/10.1145\/3377929.3389900 . Accepted for publication","DOI":"10.1145\/3377929.3389900"},{"key":"47_CR23","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.swevo.2018.06.003","volume":"43","author":"S Mishra","year":"2018","unstructured":"Mishra, S., Mondal, S., Saha, S., Coello Coello, C.A.: GBOS: generalized best order sort algorithm for non-dominated sorting. Swarm Evol. Comput. 43, 244\u2013264 (2018)","journal-title":"Swarm Evol. Comput."},{"key":"47_CR24","doi-asserted-by":"crossref","unstructured":"Mishra, S., Saha, S., Mondal, S.: Divide and conquer based non-dominated sorting for parallel environment. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 4297\u20134304. IEEE (2016)","DOI":"10.1109\/CEC.2016.7744336"},{"key":"47_CR25","doi-asserted-by":"crossref","unstructured":"Mishra, S., Saha, S., Mondal, S.: MBOS: modified best order sort algorithm for performing non-dominated sorting. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 725\u2013732. IEEE (2018)","DOI":"10.1109\/CEC.2018.8477804"},{"key":"47_CR26","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1016\/j.swevo.2018.08.011","volume":"44","author":"S Mishra","year":"2019","unstructured":"Mishra, S., Saha, S., Mondal, S., Coello Coello, C.A.: A divide-and-conquer based efficient non-dominated sorting approach. Swarm Evol. Comput. 44, 748\u2013773 (2019)","journal-title":"Swarm Evol. Comput."},{"key":"47_CR27","doi-asserted-by":"publisher","unstructured":"Moreno, J., Rodriguez, D., Nebro, A.J., Lozano, J.A.: Merge nondominated sorting algorithm for many-objective optimization. IEEE Trans. Cybern. (2020). https:\/\/doi.org\/10.1109\/TCYB.2020.2968301 . Accepted for publication","DOI":"10.1109\/TCYB.2020.2968301"},{"key":"47_CR28","doi-asserted-by":"crossref","unstructured":"Roy, P., Hussein, R., Deb, K.: Metamodeling for multimodal selection functions in evolutionary multi-objective optimization. In: Proceedings of Genetic and Evolutionary Computation Conference, pp. 625\u2013632. ACM (2017)","DOI":"10.1145\/3071178.3071219"},{"key":"47_CR29","doi-asserted-by":"crossref","unstructured":"Roy, P.C., Deb, K.: High dimensional model representation for solving expensive multi-objective optimization problems. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 2490\u20132497. IEEE (2016)","DOI":"10.1109\/CEC.2016.7744098"},{"issue":"3","key":"47_CR30","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1109\/TCYB.2017.2789158","volume":"49","author":"PC Roy","year":"2019","unstructured":"Roy, P.C., Deb, K., Islam, M.M.: An efficient nondominated sorting algorithm for large number of fronts. IEEE Trans. Cybern. 49(3), 859\u2013869 (2019)","journal-title":"IEEE Trans. Cybern."},{"key":"47_CR31","doi-asserted-by":"crossref","unstructured":"Roy, P.C., Islam, M.M., Deb, K.: Best order sort: a new algorithm to non-dominated sorting for evolutionary multi-objective optimization. In: Proceedings of Genetic and Evolutionary Computation Conference Companion, pp. 1113\u20131120. ACM (2016)","DOI":"10.1145\/2908961.2931684"},{"issue":"3","key":"47_CR32","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas, N., Deb, K.: Multiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2(3), 221\u2013248 (1994)","journal-title":"Evol. Comput."},{"key":"47_CR33","doi-asserted-by":"crossref","unstructured":"Tang, S., Cai, Z., Zheng, J.: A fast method of constructing the non-dominated set: arena\u2019s principle. In: 4th International Conference on Natural Computation, pp. 391\u2013395. IEEE (2008)","DOI":"10.1109\/ICNC.2008.823"},{"key":"47_CR34","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, C., Diao, Y., Zeng, S., Wang, H.: An efficient nondominated sorting algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 203\u2013204. ACM (2018)","DOI":"10.1145\/3205651.3205663"},{"issue":"2","key":"47_CR35","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TEVC.2014.2308305","volume":"19","author":"X Zhang","year":"2015","unstructured":"Zhang, X., Tian, Y., Cheng, R., Jin, Y.: An efficient approach to nondominated sorting for evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 19(2), 201\u2013213 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"47_CR36","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/TEVC.2016.2600642","volume":"22","author":"X Zhang","year":"2018","unstructured":"Zhang, X., Tian, Y., Cheng, R., Jin, Y.: A decision variable clustering-based evolutionary algorithm for large-scale many-objective optimization. IEEE Trans. Evol. Comput. 22(1), 97\u2013112 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"47_CR37","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TEVC.2014.2308305","volume":"19","author":"X Zhang","year":"2015","unstructured":"Zhang, X., Tian, Y., Cheng, R., Yaochu, J.: An efficient approach to nondominated sorting for evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 19(2), 201\u2013213 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"47_CR38","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1109\/TEVC.2014.2378512","volume":"19","author":"X Zhang","year":"2015","unstructured":"Zhang, X., Tian, Y., Jin, Y.: A knee point-driven evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 19(6), 761\u2013776 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"47_CR39","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/TEVC.2016.2567648","volume":"21","author":"Y Zhou","year":"2017","unstructured":"Zhou, Y., Chen, Z., Zhang, J.: Ranking vectors by means of the dominance degree matrix. IEEE Trans. Evol. Comput. 21(1), 34\u201351 (2017)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58115-2_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T00:45:49Z","timestamp":1723509949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-2_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","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":"268","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":"99","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":"37% - 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":"3","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":"2.2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}