{"id":"https://openalex.org/W4285805548","doi":"https://doi.org/10.1145/3520304.3528777","title":"Counterexample to the best-case running time of efficient non-dominated sorting algorithm","display_name":"Counterexample to the best-case running time of efficient non-dominated sorting algorithm","publication_year":2022,"publication_date":"2022-07-09","ids":{"openalex":"https://openalex.org/W4285805548","doi":"https://doi.org/10.1145/3520304.3528777"},"language":"en","primary_location":{"id":"doi:10.1145/3520304.3528777","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3520304.3528777","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060620850","display_name":"Paras Nigam","orcid":null},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]},{"id":"https://openalex.org/I4210089896","display_name":"Indian Institute of Information Technology Guwahati","ror":"https://ror.org/00bb9ch64","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210089896"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Paras Nigam","raw_affiliation_strings":["IIIT Guwahati, Guwahati, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIIT Guwahati, Guwahati, India","institution_ids":["https://openalex.org/I4210089896","https://openalex.org/I1317621060"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021971352","display_name":"Sumit Mishra","orcid":"https://orcid.org/0000-0001-9333-2001"},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]},{"id":"https://openalex.org/I4210089896","display_name":"Indian Institute of Information Technology Guwahati","ror":"https://ror.org/00bb9ch64","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210089896"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sumit Mishra","raw_affiliation_strings":["IIIT Guwahati, Guwahati, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IIIT Guwahati, Guwahati, India","institution_ids":["https://openalex.org/I4210089896","https://openalex.org/I1317621060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5193,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.53061224,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"798","last_page":"800"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.8497105836868286},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.7265669703483582},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.7204520106315613},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6129351854324341},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.6099843978881836},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.5977417826652527},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5776780247688293},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5679380297660828},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5498200058937073},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5270076990127563},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5218952298164368},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3088476061820984},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1011933982372284}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.8497105836868286},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.7265669703483582},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.7204520106315613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6129351854324341},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.6099843978881836},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5977417826652527},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5776780247688293},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5679380297660828},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5498200058937073},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5270076990127563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5218952298164368},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3088476061820984},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1011933982372284},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3520304.3528777","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3520304.3528777","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1833634424","https://openalex.org/W2042011228","https://openalex.org/W2126105956","https://openalex.org/W2352407177","https://openalex.org/W2863222099"],"related_works":["https://openalex.org/W2906115061","https://openalex.org/W2977596624","https://openalex.org/W2145877535","https://openalex.org/W2744730182","https://openalex.org/W3134440233","https://openalex.org/W2751605210","https://openalex.org/W3151104768","https://openalex.org/W2419109832","https://openalex.org/W2068949283","https://openalex.org/W2891428731"],"abstract_inverted_index":{"Non-dominated":[0,32],"sorting":[1],"is":[2,52],"one":[3],"of":[4,22,28,69,73],"the":[5,20,25,36,64,76],"important":[6],"steps":[7],"in":[8,24,75],"Pareto":[9],"dominance-based":[10],"multiobjective":[11],"evolutionary":[12],"algorithms.":[13],"In":[14],"this":[15,56],"paper,":[16],"we":[17,58],"show":[18],"that":[19,72],"number":[21,68],"comparisons":[23,70],"best":[26],"case":[27],"an":[29],"approach,":[30],"Efficient":[31,39],"Sort":[33],"(ENS)":[34],"from":[35],"paper":[37],"\"An":[38],"Approach":[40],"to":[41],"Nondominated":[42],"Sorting":[43],"for":[44],"Evolutionary":[45],"Multiobjective":[46],"Optimization\"":[47],"by":[48],"Zhang":[49],"et":[50],"al.,":[51],"not":[53],"correct.":[54],"For":[55],"purpose,":[57],"have":[59],"identified":[60],"a":[61],"scenario":[62],"where":[63],"approach":[65],"performs":[66],"less":[67],"than":[71],"reported":[74],"paper.":[77]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}