{"id":"https://openalex.org/W2155766658","doi":"https://doi.org/10.1016/j.tcs.2006.05.012","title":"A <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mstyle displaystyle=\"false\"><mml:mfrac><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac></mml:mstyle></mml:math>-approximation algorithm for scheduling identical malleable tasks","display_name":"A <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mstyle displaystyle=\"false\"><mml:mfrac><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac></mml:mstyle></mml:math>-approximation algorithm for scheduling identical malleable tasks","publication_year":2006,"publication_date":"2006-06-14","ids":{"openalex":"https://openalex.org/W2155766658","doi":"https://doi.org/10.1016/j.tcs.2006.05.012","mag":"2155766658"},"language":"lv","primary_location":{"id":"doi:10.1016/j.tcs.2006.05.012","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.tcs.2006.05.012","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","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/A5042463876","display_name":"Thomas Decker","orcid":"https://orcid.org/0000-0001-9683-0620"},"institutions":[{"id":"https://openalex.org/I4210132444","display_name":"Systems, Applications & Products in Data Processing (Germany)","ror":"https://ror.org/03dsc8d33","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210132444"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"T. Decker","raw_affiliation_strings":["SAP AG, Dietmar-Hopp-Allee 16, D-69190 Walldorf, Germany"],"affiliations":[{"raw_affiliation_string":"SAP AG, Dietmar-Hopp-Allee 16, D-69190 Walldorf, Germany","institution_ids":["https://openalex.org/I4210132444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041351482","display_name":"Thomas L\u00fccking","orcid":null},"institutions":[{"id":"https://openalex.org/I4210132444","display_name":"Systems, Applications & Products in Data Processing (Germany)","ror":"https://ror.org/03dsc8d33","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210132444"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"T. L\u00fccking","raw_affiliation_strings":["SAP AG, Dietmar-Hopp-Allee 16, D-69190 Walldorf, Germany"],"affiliations":[{"raw_affiliation_string":"SAP AG, Dietmar-Hopp-Allee 16, D-69190 Walldorf, Germany","institution_ids":["https://openalex.org/I4210132444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086678348","display_name":"Burkhard Monien","orcid":"https://orcid.org/0000-0003-2334-6795"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"B. Monien","raw_affiliation_strings":["University of Paderborn, F\u00fcrstenallee 11, D-33102 Paderborn, Germany"],"affiliations":[{"raw_affiliation_string":"University of Paderborn, F\u00fcrstenallee 11, D-33102 Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5041351482"],"corresponding_institution_ids":["https://openalex.org/I4210132444"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":2.4552,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.89614695,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"361","issue":"2-3","first_page":"226","last_page":"240"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9997000098228455,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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.9988999962806702,"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/schedule","display_name":"Schedule","score":0.777187705039978},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.606690526008606},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5953089594841003},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5097029209136963},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47923043370246887},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4472792148590088},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35224661231040955},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34810173511505127},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33214983344078064},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09716299176216125}],"concepts":[{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.777187705039978},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.606690526008606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5953089594841003},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5097029209136963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47923043370246887},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4472792148590088},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35224661231040955},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34810173511505127},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33214983344078064},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09716299176216125},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.tcs.2006.05.012","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.tcs.2006.05.012","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W115612895","https://openalex.org/W175711003","https://openalex.org/W1979415050","https://openalex.org/W1985211757","https://openalex.org/W2010224807","https://openalex.org/W2018125025","https://openalex.org/W2019318803","https://openalex.org/W2031210751","https://openalex.org/W2057913648","https://openalex.org/W2059422698","https://openalex.org/W2071091006","https://openalex.org/W2086190489","https://openalex.org/W2102061396","https://openalex.org/W2110526045","https://openalex.org/W2116636977","https://openalex.org/W2151532947","https://openalex.org/W2152362214","https://openalex.org/W2154305205","https://openalex.org/W2341350247","https://openalex.org/W2501610572","https://openalex.org/W2504554295","https://openalex.org/W2505728611","https://openalex.org/W2581172100","https://openalex.org/W3023226084","https://openalex.org/W3138484722","https://openalex.org/W4251681643","https://openalex.org/W4254292280"],"related_works":["https://openalex.org/W4247094814","https://openalex.org/W2352794675","https://openalex.org/W1526989670","https://openalex.org/W108531593","https://openalex.org/W8810113","https://openalex.org/W2158636562","https://openalex.org/W2111712077","https://openalex.org/W2051228988","https://openalex.org/W2162911572","https://openalex.org/W2004969663"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}