{"id":"https://openalex.org/W1739027797","doi":"https://doi.org/10.1007/3-540-44520-x_38","title":"Scheduling Trees with Large Communication Delays on Two Identical Processors","display_name":"Scheduling Trees with Large Communication Delays on Two Identical Processors","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1739027797","doi":"https://doi.org/10.1007/3-540-44520-x_38","mag":"1739027797"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44520-x_38","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-44520-x_38","pdf_url":"https://link.springer.com/content/pdf/10.1007/3-540-44520-X_38.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/3-540-44520-X_38.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088568415","display_name":"Foto Afrati","orcid":null},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Foto Afrati","raw_affiliation_strings":["Division of Computer Science, National Technical University of Athens, Heroon Polytechniou 9, 15773, Athens, Greece"],"affiliations":[{"raw_affiliation_string":"Division of Computer Science, National Technical University of Athens, Heroon Polytechniou 9, 15773, Athens, Greece","institution_ids":["https://openalex.org/I174458059"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063171222","display_name":"Evripidis Bampis","orcid":"https://orcid.org/0000-0002-4498-3040"},"institutions":[{"id":"https://openalex.org/I88467170","display_name":"Universit\u00e9 d'\u00c9vry Val-d'Essonne","ror":"https://ror.org/00e96v939","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954","https://openalex.org/I88467170"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Evripidis Bampis","raw_affiliation_strings":["LaMI, Universit\u00e9 d\u2019Evry, Boulevard des Coquibus, 91025, Evry Cedex, France","LaMI, Universit\u00e9 d'Evry, Boulevard des Coquibus, 91025, Evry Cedex, France"],"affiliations":[{"raw_affiliation_string":"LaMI, Universit\u00e9 d\u2019Evry, Boulevard des Coquibus, 91025, Evry Cedex, France","institution_ids":["https://openalex.org/I88467170"]},{"raw_affiliation_string":"LaMI, Universit\u00e9 d'Evry, Boulevard des Coquibus, 91025, Evry Cedex, France","institution_ids":["https://openalex.org/I88467170"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026387960","display_name":"Lucian Finta","orcid":null},"institutions":[{"id":"https://openalex.org/I4210091279","display_name":"Universit\u00e9 Sorbonne Paris Nord","ror":"https://ror.org/0199hds37","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210091279"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lucian Finta","raw_affiliation_strings":["LIPN, Universit\u00e9 Paris, 13, Avenue Jean-Baptiste Cl\u00e9ment, 93430, Villetaneuse Cedex, France"],"affiliations":[{"raw_affiliation_string":"LIPN, Universit\u00e9 Paris, 13, Avenue Jean-Baptiste Cl\u00e9ment, 93430, Villetaneuse Cedex, France","institution_ids":["https://openalex.org/I4210091279","https://openalex.org/I4210156583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011937346","display_name":"Ioannis Milis","orcid":null},"institutions":[{"id":"https://openalex.org/I73142707","display_name":"Athens University of Economics and Business","ror":"https://ror.org/03s262162","country_code":"GR","type":"education","lineage":["https://openalex.org/I73142707"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Ioannis Milis","raw_affiliation_strings":["Department of Informatics, Athens University of Economics and Business, Patission 76, 10434, Athens, Greece"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, Athens University of Economics and Business, Patission 76, 10434, Athens, Greece","institution_ids":["https://openalex.org/I73142707"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5088568415"],"corresponding_institution_ids":["https://openalex.org/I174458059"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.14927114,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"288","last_page":"295"},"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.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"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9977999925613403,"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/computer-science","display_name":"Computer science","score":0.8245683908462524},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.660987913608551},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6478822231292725},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.624348521232605},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6155903339385986},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.49831295013427734},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.4815383553504944},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4406338036060333},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3533327579498291},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29487842321395874},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2154843807220459},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15037000179290771},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11896541714668274},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09806522727012634}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8245683908462524},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.660987913608551},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6478822231292725},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.624348521232605},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6155903339385986},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.49831295013427734},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.4815383553504944},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4406338036060333},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3533327579498291},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29487842321395874},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2154843807220459},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15037000179290771},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11896541714668274},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09806522727012634},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-44520-x_38","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-44520-x_38","pdf_url":"https://link.springer.com/content/pdf/10.1007/3-540-44520-X_38.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:dspace.lib.ntua.gr:123456789/13785","is_oa":true,"landing_page_url":"http://doi.org/10.1007/3-540-44520-X_38","pdf_url":null,"source":{"id":"https://openalex.org/S4377196837","display_name":"DSpace - NTUA (National Technical University of Athens)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I174458059","host_organization_name":"National Technical University of Athens","host_organization_lineage":["https://openalex.org/I174458059"],"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":"EURO-PAR 2000 PARALLEL PROCESSING, PROCEEDINGS","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/3-540-44520-x_38","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-44520-x_38","pdf_url":"https://link.springer.com/content/pdf/10.1007/3-540-44520-X_38.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1739027797.pdf","grobid_xml":"https://content.openalex.org/works/W1739027797.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1808396869","https://openalex.org/W1973538756","https://openalex.org/W1983770018","https://openalex.org/W1989582918","https://openalex.org/W1998978603","https://openalex.org/W2011039300","https://openalex.org/W2074762232","https://openalex.org/W2086370835","https://openalex.org/W2089340573","https://openalex.org/W2092333800","https://openalex.org/W2098135206","https://openalex.org/W2148654963","https://openalex.org/W2169959848","https://openalex.org/W2581172100"],"related_works":["https://openalex.org/W2056975861","https://openalex.org/W2363556447","https://openalex.org/W2089900921","https://openalex.org/W2501849745","https://openalex.org/W2539085113","https://openalex.org/W2011933350","https://openalex.org/W1510719821","https://openalex.org/W3169685561","https://openalex.org/W2093708041","https://openalex.org/W2749663619"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}