{"id":"https://openalex.org/W2056244098","doi":"https://doi.org/10.1016/s0020-0190(97)00008-2","title":"On approximating the memory-Constrained Module Allocation Problem","display_name":"On approximating the memory-Constrained Module Allocation Problem","publication_year":1997,"publication_date":"1997-02-01","ids":{"openalex":"https://openalex.org/W2056244098","doi":"https://doi.org/10.1016/s0020-0190(97)00008-2","mag":"2056244098"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(97)00008-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(97)00008-2","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-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/A5058178414","display_name":"Fr\u00e9d\u00e9ric Roupin","orcid":null},"institutions":[{"id":"https://openalex.org/I4210097372","display_name":"\u00c9cole Nationale Sup\u00e9rieure d\u2019Informatique pour l\u2019Industrie et l\u2019Entreprise","ror":"https://ror.org/00tx98v53","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210097372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Fr\u00e9d\u00e9ric Roupin","raw_affiliation_strings":["Institut d'Informatique d'Entreprise, 18 all\u00e9e Jean Rostand, 91025 Evry Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut d'Informatique d'Entreprise, 18 all\u00e9e Jean Rostand, 91025 Evry Cedex, France","institution_ids":["https://openalex.org/I4210097372"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5058178414"],"corresponding_institution_ids":["https://openalex.org/I4210097372"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.20801321,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"61","issue":"4","first_page":"205","last_page":"208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/computer-science","display_name":"Computer science","score":0.6222564578056335},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6131528615951538},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5309241414070129},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5165261626243591},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49118348956108093},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4759775698184967},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.447539746761322},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.4215271770954132},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39838358759880066},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.314785897731781},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2994694113731384},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23749783635139465},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16703519225120544}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6222564578056335},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6131528615951538},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5309241414070129},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5165261626243591},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49118348956108093},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4759775698184967},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.447539746761322},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.4215271770954132},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39838358759880066},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.314785897731781},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2994694113731384},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23749783635139465},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16703519225120544},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0020-0190(97)00008-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(97)00008-2","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-00596196v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00596196","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Information Processing Letters, 1997, 61 (4), pp.205-208. ⟨10.1016/S0020-0190(97)00008-2⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1486083926","https://openalex.org/W1494018018","https://openalex.org/W2011039300","https://openalex.org/W2062134187","https://openalex.org/W2067936976","https://openalex.org/W2149065651","https://openalex.org/W2152986618","https://openalex.org/W2507385285","https://openalex.org/W3083248958","https://openalex.org/W6629593048","https://openalex.org/W6666080548","https://openalex.org/W6724870214","https://openalex.org/W6782461722"],"related_works":["https://openalex.org/W3161249280","https://openalex.org/W2267059662","https://openalex.org/W2364268683","https://openalex.org/W4388411807","https://openalex.org/W1519906715","https://openalex.org/W2478803962","https://openalex.org/W1598028160","https://openalex.org/W1971979548","https://openalex.org/W961142965","https://openalex.org/W4214914101"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}