{"id":"https://openalex.org/W2062851876","doi":"https://doi.org/10.1155/2011/476939","title":"Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks","display_name":"Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2062851876","doi":"https://doi.org/10.1155/2011/476939","mag":"2062851876"},"language":"en","primary_location":{"id":"doi:10.1155/2011/476939","is_oa":true,"landing_page_url":"http://doi.org/10.1155/2011/476939","pdf_url":"https://downloads.hindawi.com/journals/aor/2011/476939.pdf","source":{"id":"https://openalex.org/S33782831","display_name":"Advances in Operations Research","issn_l":"1687-9147","issn":["1687-9147","1687-9155"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://downloads.hindawi.com/journals/aor/2011/476939.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086376399","display_name":"Marwane Bouznif","orcid":"https://orcid.org/0000-0002-5138-1582"},"institutions":[{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"M. Bouznif","raw_affiliation_strings":["Laboratoire G-SCOP, 46 avenue F\u00e9lix Viallet, 38031 Grenoble Cedex 1, France","Optimisation Combinatoire"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire G-SCOP, 46 avenue F\u00e9lix Viallet, 38031 Grenoble Cedex 1, France","institution_ids":["https://openalex.org/I4210094718"]},{"raw_affiliation_string":"Optimisation Combinatoire","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011468870","display_name":"Rodolphe Giroudeau","orcid":"https://orcid.org/0000-0002-7544-8542"},"institutions":[{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4405261681"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"R. Giroudeau","raw_affiliation_strings":["LIRMM, 161 rue Ada, UMR 5056, 34392 Montpellier Cedex 5, France"],"raw_orcid":"https://orcid.org/0000-0002-7544-8542","affiliations":[{"raw_affiliation_string":"LIRMM, 161 rue Ada, UMR 5056, 34392 Montpellier Cedex 5, France","institution_ids":["https://openalex.org/I4210101743"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086376399"],"corresponding_institution_ids":["https://openalex.org/I4210094718"],"apc_list":{"value":1025,"currency":"USD","value_usd":1025},"apc_paid":{"value":1025,"currency":"USD","value_usd":1025},"fwci":0.7624,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.7757705,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2011","issue":null,"first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9904999732971191,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9896000027656555,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7379860877990723},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6442534923553467},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.5904164910316467},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5774630308151245},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5136298537254333},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5058515071868896},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46520930528640747},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4369385242462158},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4184228181838989},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38126140832901},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3386072516441345},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28986692428588867},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.18721306324005127},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07259786128997803}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7379860877990723},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6442534923553467},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.5904164910316467},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5774630308151245},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5136298537254333},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5058515071868896},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46520930528640747},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4369385242462158},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4184228181838989},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38126140832901},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3386072516441345},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28986692428588867},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.18721306324005127},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07259786128997803},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1155/2011/476939","is_oa":true,"landing_page_url":"http://doi.org/10.1155/2011/476939","pdf_url":"https://downloads.hindawi.com/journals/aor/2011/476939.pdf","source":{"id":"https://openalex.org/S33782831","display_name":"Advances in Operations Research","issn_l":"1687-9147","issn":["1687-9147","1687-9155"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:HAL:lirmm-00605652v1","is_oa":true,"landing_page_url":"https://hal-lirmm.ccsd.cnrs.fr/lirmm-00605652","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Advances in Operations Research, 2011, 2011, pp.#476939. ⟨10.1155/2011/476939⟩","raw_type":"Journal articles"},{"id":"pmh:oai:RePEc:hin:jnlaor:476939","is_oa":false,"landing_page_url":"http://downloads.hindawi.com/journals/AOR/2011/476939.xml","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:doaj.org/article:3ac61ff7a3254b54bcb691c4dd8a6fcb","is_oa":true,"landing_page_url":"https://doaj.org/article/3ac61ff7a3254b54bcb691c4dd8a6fcb","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Advances in Operations Research, Vol 2011 (2011)","raw_type":"article"},{"id":"pmh:oai:hindawi.com:10.1155/2011/476939","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2011/476939","pdf_url":null,"source":{"id":"https://openalex.org/S4306400340","display_name":"Hindawi Journal of Chemistry (Hindawi)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210126990","host_organization_name":"Hindawi (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210126990"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Research Article"}],"best_oa_location":{"id":"doi:10.1155/2011/476939","is_oa":true,"landing_page_url":"http://doi.org/10.1155/2011/476939","pdf_url":"https://downloads.hindawi.com/journals/aor/2011/476939.pdf","source":{"id":"https://openalex.org/S33782831","display_name":"Advances in Operations Research","issn_l":"1687-9147","issn":["1687-9147","1687-9155"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advances in Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2062851876.pdf","grobid_xml":"https://content.openalex.org/works/W2062851876.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1605903747","https://openalex.org/W1985059007","https://openalex.org/W2005955982","https://openalex.org/W2011039300","https://openalex.org/W2060160256","https://openalex.org/W2065689629","https://openalex.org/W2076173115","https://openalex.org/W2078031780","https://openalex.org/W2089269509","https://openalex.org/W2105884810","https://openalex.org/W2130566259","https://openalex.org/W2227557434"],"related_works":["https://openalex.org/W2413588304","https://openalex.org/W3087772622","https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W2151412766","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415"],"abstract_inverted_index":{"We":[0,23,63,75],"investigate":[1],"complexity":[2,65],"and":[3,55],"approximation":[4],"results":[5,66],"on":[6,15,44,87],"a":[7,32,45,59,72],"processor":[8,49,88],"networks":[9,50,89],"where":[10],"the":[11,16,19,68,84],"communication":[12],"delay":[13],"depends":[14],"distance":[17],"between":[18],"processors":[20],"performing":[21],"tasks.":[22],"then":[24],"prove":[25],"that":[26],"there":[27],"is":[28,71],"no":[29],"heuristic":[30],"with":[31,58,90],"performance":[33],"guarantee":[34],"smaller":[35],"than":[36],"4/3":[37],"for":[38,41,83],"makespan":[39,85],"minimization":[40,86],"precedence":[42,69],"graph":[43,70],"large":[46],"class":[47],"of":[48],"like":[51],"hypercube,":[52],"grid,":[53],"torus,":[54],"so":[56],"forth,":[57],"fixed":[60],"diameter":[61,91],".":[62,92],"extend":[64],"when":[67],"bipartite":[73],"graph.":[74],"also":[76],"design":[77],"an":[78],"efficient":[79],"polynomial-time":[80],"-approximation":[81],"algorithm":[82]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}