{"id":"https://openalex.org/W3046402330","doi":"https://doi.org/10.1145/3377929.3390073","title":"Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting","display_name":"Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting","publication_year":2020,"publication_date":"2020-07-08","ids":{"openalex":"https://openalex.org/W3046402330","doi":"https://doi.org/10.1145/3377929.3390073","mag":"3046402330"},"language":"en","primary_location":{"id":"doi:10.1145/3377929.3390073","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3377929.3390073","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.aalto.fi/en/publications/ba0fdfa9-eae9-4b57-a80d-493c89d825de","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068060092","display_name":"Sorrachai Yingchareonthawornchai","orcid":"https://orcid.org/0000-0002-7169-0163"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Sorrachai Yingchareonthawornchai","raw_affiliation_strings":["Aalto University, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aalto University, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103034667","display_name":"Proteek Chandan Roy","orcid":"https://orcid.org/0000-0002-1646-9239"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Proteek Chandan Roy","raw_affiliation_strings":["Michigan State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Michigan State University","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005632876","display_name":"Bundit Laekhanukit","orcid":"https://orcid.org/0000-0002-4476-8914"},"institutions":[{"id":"https://openalex.org/I181679659","display_name":"Shanghai University of Finance and Economics","ror":"https://ror.org/00wtvfq62","country_code":"CN","type":"education","lineage":["https://openalex.org/I181679659"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bundit Laekhanukit","raw_affiliation_strings":["Shanghai University of Finance and Economics, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai University of Finance and Economics, China","institution_ids":["https://openalex.org/I181679659"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027040066","display_name":"Eric Torng","orcid":"https://orcid.org/0000-0002-1400-0840"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eric Torng","raw_affiliation_strings":["Michigan State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Michigan State University","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088394271","display_name":"Kalyanmoy Deb","orcid":"https://orcid.org/0000-0001-7402-9939"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kalyanmoy Deb","raw_affiliation_strings":["Michigan State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Michigan State University","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"185","last_page":"186"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9958000183105469,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7643564343452454},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7231605648994446},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5455067753791809},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4935861825942993},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4930379092693329},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47634127736091614},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47232574224472046},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45754098892211914},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45266565680503845},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.440395712852478},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.42734211683273315},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3757525682449341},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2763133645057678},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06341084837913513}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7643564343452454},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7231605648994446},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5455067753791809},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4935861825942993},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4930379092693329},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47634127736091614},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47232574224472046},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45754098892211914},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45266565680503845},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.440395712852478},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.42734211683273315},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3757525682449341},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2763133645057678},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06341084837913513},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3377929.3390073","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3377929.3390073","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/101600","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/ba0fdfa9-eae9-4b57-a80d-493c89d825de","pdf_url":null,"source":{"id":"https://openalex.org/S4306401663","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/101600","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/ba0fdfa9-eae9-4b57-a80d-493c89d825de","pdf_url":null,"source":{"id":"https://openalex.org/S4306401663","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7842005466","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8380195983","display_name":null,"funder_award_id":"759557","funder_id":"https://openalex.org/F4320338352","funder_display_name":"FP7 Ideas: European Research Council"},{"id":"https://openalex.org/G8939654172","display_name":null,"funder_award_id":"61932002","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320324781","display_name":"Shanghai University of Finance and Economics","ror":"https://ror.org/00wtvfq62"},{"id":"https://openalex.org/F4320335787","display_name":"Fundamental Research Funds for the Central Universities","ror":null},{"id":"https://openalex.org/F4320338352","display_name":"FP7 Ideas: European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1999003043","https://openalex.org/W2024116303","https://openalex.org/W2042011228","https://openalex.org/W2126997347","https://openalex.org/W2477866957","https://openalex.org/W2510493362"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W3033694952","https://openalex.org/W2372558933","https://openalex.org/W2349288944","https://openalex.org/W2085265870","https://openalex.org/W797244100","https://openalex.org/W1999431223","https://openalex.org/W2043772124","https://openalex.org/W2801186172","https://openalex.org/W2367560286"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,6,28,76,109,122],"computational":[3],"complexity":[4],"of":[5,15,30,65],"non-dominated":[7,77],"sorting":[8],"problem":[9],"(NDS):":[10],"Given":[11],"a":[12,85,103],"set":[13],"P":[14],"n":[16,115],"points":[17,78],"in":[18,59,79],"Rm,":[19],"for":[20,88],"each":[21],"point":[22],"p":[23],"\u2208":[24],"P,":[25],"compute":[26],"\u2113,":[27],"length":[29],"longest":[31],"domination":[32],"chain":[33],"p1":[34],">":[35,37,39,50,107],"p2":[36],"\u00b7\u00b7\u00b7":[38],"p\u2113":[40],"=":[41],"p,":[42],"where":[43],"x":[44,49,53],"dominates":[45],"y":[46,58],"(denoted":[47],"as":[48,70,84],"y)":[51],"if":[52],"is":[54,72,100,112,125],"not":[55],"larger":[56,120],"than":[57],"every":[60],"coordinate.":[61],"A":[62],"special":[63],"case":[64],"NDS,":[66],"which":[67],"we":[68],"label":[69],"NDS1,":[71],"to":[73],"find":[74],"all":[75],"P.":[80],"NDS":[81],"has":[82],"emerged":[83],"critical":[86],"component":[87],"multi-objective":[89],"optimization":[90],"problems":[91],"(MOPs).":[92],"For":[93,102,119],"m":[94,106],"\u2264":[95],"3,":[96,108],"\u0398(n":[97],"log":[98,116,117],"n)-time":[99],"known.":[101],"fixed":[104],"small":[105],"best":[110,123],"bound":[111],"O(n":[113],"logm-2":[114],"n).":[118],"m,":[121],"result":[124],"an":[126],"O(mn2)-time":[127],"algorithm.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-18T07:39:51.176621","created_date":"2025-10-10T00:00:00"}