{"id":"https://openalex.org/W2903369639","doi":"https://doi.org/10.1109/icacci.2018.8554837","title":"An Approach to Obtain the Upper Bound on the Number of Non-dominated Fronts in a Population","display_name":"An Approach to Obtain the Upper Bound on the Number of Non-dominated Fronts in a Population","publication_year":2018,"publication_date":"2018-09-01","ids":{"openalex":"https://openalex.org/W2903369639","doi":"https://doi.org/10.1109/icacci.2018.8554837","mag":"2903369639"},"language":"en","primary_location":{"id":"doi:10.1109/icacci.2018.8554837","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icacci.2018.8554837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","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/A5021971352","display_name":"Sumit Mishra","orcid":"https://orcid.org/0000-0001-9333-2001"},"institutions":[{"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":true,"raw_author_name":"Sumit Mishra","raw_affiliation_strings":["Department of CSE, Indian Institute of Information Technology, Guwahati, Assam, India"],"affiliations":[{"raw_affiliation_string":"Department of CSE, Indian Institute of Information Technology, Guwahati, Assam, India","institution_ids":["https://openalex.org/I4210089896"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060797340","display_name":"Sriparna Saha","orcid":"https://orcid.org/0000-0001-5458-9381"},"institutions":[{"id":"https://openalex.org/I132153292","display_name":"Indian Institute of Technology Patna","ror":"https://ror.org/01ft5vz71","country_code":"IN","type":"education","lineage":["https://openalex.org/I132153292"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sriparna Saha","raw_affiliation_strings":["Department of CSE, Indian Institute of Technology, Patna, Bihar, India"],"affiliations":[{"raw_affiliation_string":"Department of CSE, Indian Institute of Technology, Patna, Bihar, India","institution_ids":["https://openalex.org/I132153292"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088675403","display_name":"Samrat Mondal","orcid":"https://orcid.org/0000-0002-2159-3410"},"institutions":[{"id":"https://openalex.org/I132153292","display_name":"Indian Institute of Technology Patna","ror":"https://ror.org/01ft5vz71","country_code":"IN","type":"education","lineage":["https://openalex.org/I132153292"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Samrat Mondal","raw_affiliation_strings":["Department of CSE, Indian Institute of Technology, Patna, Bihar, India"],"affiliations":[{"raw_affiliation_string":"Department of CSE, Indian Institute of Technology, Patna, Bihar, India","institution_ids":["https://openalex.org/I132153292"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5021971352"],"corresponding_institution_ids":["https://openalex.org/I4210089896"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14381655,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"43","issue":null,"first_page":"1947","last_page":"1951"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9965000152587891,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9965000152587891,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11106","display_name":"Data Management and Algorithms","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8851758241653442},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.6565795540809631},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6290162801742554},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5818317532539368},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5214530825614929},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1917816400527954},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07907840609550476},{"id":"https://openalex.org/keywords/demography","display_name":"Demography","score":0.06054115295410156}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8851758241653442},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.6565795540809631},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6290162801742554},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5818317532539368},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5214530825614929},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1917816400527954},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07907840609550476},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.06054115295410156},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icacci.2018.8554837","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icacci.2018.8554837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1553976291","https://openalex.org/W1833634424","https://openalex.org/W1998050824","https://openalex.org/W2022485595","https://openalex.org/W2042235527","https://openalex.org/W2126105956","https://openalex.org/W2143973862","https://openalex.org/W2146531337","https://openalex.org/W2170890137","https://openalex.org/W2477866957","https://openalex.org/W2510493362","https://openalex.org/W2559305255","https://openalex.org/W2579525752","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2042127053"],"abstract_inverted_index":{"In":[0,18],"this":[1],"paper,":[2],"we":[3,66,115],"obtain":[4,56,71],"the":[5,10,20,36,48,61,72,77,86,91,101,110,113,117,126,132],"tight":[6,73],"upper":[7,58,74,92],"bound":[8,59,75,93],"on":[9,60,76],"number":[11,22,38,62,78,102],"of":[12,23,29,39,63,79,89,103,120,131],"non-dominated":[13,24,40,80],"fronts":[14,25,41,81],"in":[15,26,109],"a":[16,27],"population.":[17,111],"general,":[19],"maximum":[21],"population":[28],"size":[30],"N":[31,34],"can":[32,42],"be":[33,43],"and":[35,82,123,128],"minimum":[37],"1.":[44],"However,":[45],"without":[46],"sorting":[47],"entire":[49],"population,":[50],"it":[51],"is":[52,94,100],"very":[53],"difficult":[54],"to":[55,70],"an":[57,68],"fronts.":[64],"Here,":[65],"present":[67],"algorithm":[69],"also":[83,124],"prove":[84,125],"that":[85],"time":[87,129],"complexity":[88],"obtaining":[90],"O(MN":[95],"log":[96],"N)":[97],"where":[98],"M":[99],"objectives":[104],"associate":[105],"with":[106],"each":[107],"solution":[108],"At":[112],"end":[114],"propose":[116],"parallel":[118,133],"version":[119],"our":[121],"approach":[122],"space":[127],"complexities":[130],"version.":[134]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}