{"id":"https://openalex.org/W1984939896","doi":"https://doi.org/10.1137/0216013","title":"Scheduling File Transfers for Trees and Odd Cycles","display_name":"Scheduling File Transfers for Trees and Odd Cycles","publication_year":1987,"publication_date":"1987-02-01","ids":{"openalex":"https://openalex.org/W1984939896","doi":"https://doi.org/10.1137/0216013","mag":"1984939896"},"language":"en","primary_location":{"id":"doi:10.1137/0216013","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0216013","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5103910452","display_name":"Hyeong\u2010Ah Choi","orcid":null},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hyeong-Ah Choi","raw_affiliation_strings":["Michigan State Univ., East Lansing#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Michigan State Univ., East Lansing#TAB#","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108528137","display_name":"S. L. Hakimi","orcid":null},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Louis Hakimi","raw_affiliation_strings":["university of california, davis"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"university of california, davis","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5452,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.89338876,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"16","issue":"1","first_page":"162","last_page":"168"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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.7110183835029602},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6126942038536072},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5258967280387878},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5050988793373108},{"id":"https://openalex.org/keywords/file-transfer","display_name":"File transfer","score":0.4871346652507782},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48685377836227417},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4524388313293457},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.45136192440986633},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4260137677192688},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3800320327281952},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.29271870851516724},{"id":"https://openalex.org/keywords/transfer","display_name":"Transfer (computing)","score":0.25589317083358765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25448399782180786}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7110183835029602},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6126942038536072},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5258967280387878},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5050988793373108},{"id":"https://openalex.org/C2776162994","wikidata":"https://www.wikidata.org/wiki/Q534400","display_name":"File transfer","level":3,"score":0.4871346652507782},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48685377836227417},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4524388313293457},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.45136192440986633},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4260137677192688},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3800320327281952},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29271870851516724},{"id":"https://openalex.org/C2776175482","wikidata":"https://www.wikidata.org/wiki/Q1195816","display_name":"Transfer (computing)","level":2,"score":0.25589317083358765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25448399782180786},{"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.1137/0216013","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0216013","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":3,"referenced_works":["https://openalex.org/W1997370889","https://openalex.org/W2035404925","https://openalex.org/W2168013937"],"related_works":["https://openalex.org/W4387560420","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W1589381382","https://openalex.org/W4299801389","https://openalex.org/W961142965","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337","https://openalex.org/W2113623403"],"abstract_inverted_index":{"The":[0],"scheduling":[1],"of":[2,80,90],"file":[3],"transfers":[4],"in":[5],"networks":[6],"to":[7],"minimize":[8],"the":[9,20,52,73,78,120],"overall":[10],"finishing":[11],"time":[12,100],"was":[13,113],"studied":[14],"by":[15,119],"Coffman,":[16],"et":[17],"al.":[18],"where":[19],"schedule":[21,106],"does":[22],"not":[23],"permit":[24],"interruption":[25],"and":[26,36,57,82],"each":[27],"communication":[28],"module":[29],"can":[30],"be":[31],"used":[32],"as":[33,37,115],"a":[34,38,98],"transmitter":[35],"receiver.":[39],"They":[40],"first":[41,63],"presented":[42],"complexity":[43,112],"results":[44],"under":[45],"various":[46],"conditions.":[47],"Then":[48,94],"they":[49],"showed":[50],"that":[51],"general":[53],"problem":[54],"is":[55],"NP-complete":[56],"provided":[58],"approximation":[59,67,92],"algorithms.":[60,93],"This":[61],"paper":[62,96],"presents":[64],"more":[65],"efficient":[66],"algorithms":[68,76],"with":[69],"better":[70],"performances":[71],"than":[72],"above":[74,121],"authors\u2019":[75],"for":[77,102,107],"cases":[79],"trees":[81],"multitrees.":[83],"Furthermore,":[84],"there":[85],"are":[86],"simple":[87],"distributed":[88],"implementations":[89],"our":[91],"this":[95],"provides":[97],"polynomial":[99],"algorithm":[101],"finding":[103],"an":[104,108,116],"optimum":[105],"odd":[109],"cycle,":[110],"whose":[111],"left":[114],"open":[117],"question":[118],"authors.":[122]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}