{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:42:29Z","timestamp":1757540549079,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031272493"},{"type":"electronic","value":"9783031272509"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-27250-9_30","type":"book-chapter","created":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T00:03:18Z","timestamp":1678320198000},"page":"419-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the\u00a0Computational Complexity of\u00a0Efficient Non-dominated Sort Using Binary Search"],"prefix":"10.1007","author":[{"given":"Ved","family":"Prakash","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sumit","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos A.","family":"Coello Coello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,9]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","unstructured":"Deb, K.: Multi-objective optimization using evolutionary algorithms: an introduction. In: Wang, L., Ng, A., Deb, K. (eds.) Multi-objective Evolutionary Optimisation for Product Design and Manufacturing, pp. 3\u201334. Springer, London (2011). https:\/\/doi.org\/10.1007\/978-0-85729-652-8_1","DOI":"10.1007\/978-0-85729-652-8_1"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","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."},{"key":"30_CR3","unstructured":"Fortin, F.A., Greiner, S., Parizeau, M.: Generalizing the improved run-time complexity algorithm for non-dominated sorting. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u20192013), pp. 615\u2013622. ACM Press, New York, USA (2013), ISBN: 978-1-4503-1963-8"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","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."},{"issue":"5","key":"30_CR5","doi-asserted-by":"publisher","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."},{"issue":"4","key":"30_CR6","doi-asserted-by":"publisher","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":"30_CR7","doi-asserted-by":"publisher","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":"30_CR8","doi-asserted-by":"publisher","unstructured":"Mishra, S., Buzdalov, M.: Filter sort is $$\\varOmega $$ ($$N^3$$) in the worst case. In: B\u00e4ck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12270, pp. 675\u2013685. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58115-2_47","DOI":"10.1007\/978-3-030-58115-2_47"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Mishra, S., Buzdalov, M.: If unsure, shuffle: deductive sort is $$\\varTheta (MN^3)$$, but $$\\cal{O} (MN^2)$$ in expectation over input permutations. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2020), pp. 516\u2013523 (2020)","DOI":"10.1145\/3377930.3390246"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Mishra, S., Buzdalov, M., Senwar, R.: Time complexity analysis of the dominance degree approach for non-dominated sorting. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO\u20192020), pp. 169\u2013170 (2020)","DOI":"10.1145\/3377929.3389900"},{"key":"30_CR11","doi-asserted-by":"publisher","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":"30_CR12","doi-asserted-by":"crossref","unstructured":"Mishra, S., Prakash, V.: Time complexity analysis of the deductive sort in the best case. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO\u20192021), pp. 337\u2013338 (2021)","DOI":"10.1145\/3449726.3459416"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Mishra, S., Saha, S., Mondal, S.: Divide and conquer based non-dominated sorting for parallel environment. In: IEEE Congress on Evolutionary Computation (CEC 2016), pp. 4297\u20134304. IEEE Press, Vancouver, Canada (2016). ISBN: 978-1-5090-0623-6","DOI":"10.1109\/CEC.2016.7744336"},{"key":"30_CR14","doi-asserted-by":"publisher","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":"30_CR15","doi-asserted-by":"crossref","unstructured":"Mishra, S., Saha, S., Mondal, S., Coello Coello, C.A.: Divide-and-conquer Based Non-dominated Sorting with Reduced Comparisons. Swarm Evol. Comput. 51, 100580 (2019). article Number: UNSP 100580","DOI":"10.1016\/j.swevo.2019.100580"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Nigam, P., Mishra, S.: Counterexample to the best-case running time of efficient non-dominated sorting algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO\u20192022), pp. 798\u2013800 (2022)","DOI":"10.1145\/3520304.3528777"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, C., Diao, Y., Zeng, S., Wang, H.: An efficient nondominated sorting algorithm. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u20192018), pp. 203\u2013204. ACM (2018)","DOI":"10.1145\/3205651.3205663"},{"issue":"1","key":"30_CR18","doi-asserted-by":"publisher","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":"30_CR19","doi-asserted-by":"publisher","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":"1","key":"30_CR20","doi-asserted-by":"publisher","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","Evolutionary Multi-Criterion Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27250-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T00:09:00Z","timestamp":1678320540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27250-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031272493","9783031272509"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27250-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EMO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Evolutionary Multi-Criterion Optimization","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"emo2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/emo2023.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":"equinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"65","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":"44","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":"68% - 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":"2.42","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.49","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)"}}]}}