{"id":"https://openalex.org/W1973053408","doi":"https://doi.org/10.1145/2332432.2332503","title":"Distributed algorithms for scheduling on line and tree networks","display_name":"Distributed algorithms for scheduling on line and tree networks","publication_year":2012,"publication_date":"2012-07-16","ids":{"openalex":"https://openalex.org/W1973053408","doi":"https://doi.org/10.1145/2332432.2332503","mag":"1973053408"},"language":"en","primary_location":{"id":"doi:10.1145/2332432.2332503","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2332432.2332503","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 ACM symposium on Principles of distributed computing","raw_type":"proceedings-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/A5008813690","display_name":"Venkatesan T. Chakaravarthy","orcid":"https://orcid.org/0000-0002-9422-7243"},"institutions":[{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Venkatesan T. Chakaravarthy","raw_affiliation_strings":["IBM Research - India, New Delhi, India"],"affiliations":[{"raw_affiliation_string":"IBM Research - India, New Delhi, India","institution_ids":["https://openalex.org/I4210103279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110192164","display_name":"Sambuddha Roy","orcid":null},"institutions":[{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sambuddha Roy","raw_affiliation_strings":["IBM Research - India, New Delhi, India"],"affiliations":[{"raw_affiliation_string":"IBM Research - India, New Delhi, India","institution_ids":["https://openalex.org/I4210103279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033885850","display_name":"Yogish Sabharwal","orcid":"https://orcid.org/0009-0002-5053-2059"},"institutions":[{"id":"https://openalex.org/I4210103279","display_name":"IBM Research - India","ror":"https://ror.org/014wt7r80","country_code":"IN","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210103279","https://openalex.org/I4210114115"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Yogish Sabharwal","raw_affiliation_strings":["IBM Research - India, New Delhi, India"],"affiliations":[{"raw_affiliation_string":"IBM Research - India, New Delhi, India","institution_ids":["https://openalex.org/I4210103279"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008813690"],"corresponding_institution_ids":["https://openalex.org/I4210103279"],"apc_list":null,"apc_paid":null,"fwci":0.6739,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68565751,"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":"345","last_page":"354"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991999864578247,"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.7972052097320557},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4641578793525696},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4226433336734772},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.40593230724334717},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39018943905830383},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.351104199886322},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19267532229423523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16578885912895203}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7972052097320557},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4641578793525696},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4226433336734772},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40593230724334717},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39018943905830383},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.351104199886322},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19267532229423523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16578885912895203}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2332432.2332503","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2332432.2332503","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1608651920","https://openalex.org/W1998643836","https://openalex.org/W2000278241","https://openalex.org/W2003902046","https://openalex.org/W2069417991","https://openalex.org/W2074104565","https://openalex.org/W2074557115","https://openalex.org/W2075883130","https://openalex.org/W2100061495","https://openalex.org/W2104685111","https://openalex.org/W2104730739","https://openalex.org/W2108031738","https://openalex.org/W2118348286","https://openalex.org/W2127719709","https://openalex.org/W2154571828","https://openalex.org/W2170344325","https://openalex.org/W2399312309"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2989452537","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W2062023542"],"abstract_inverted_index":{"We":[0],"have":[1],"a":[2,9,23,32,36,44,64,71,107,117,164,179],"set":[3,10],"of":[4,11,25,38,109],"processors":[5,98],"(or":[6],"agents)":[7],"and":[8,54,70,75,111],"graph":[12,27,65,118,150,189],"networks":[13,190],"defined":[14],"over":[15],"some":[16],"vertex":[17],"set.":[18],"Each":[19,29],"processor":[20,30,47,60,82,123],"can":[21],"access":[22,85],"subset":[24,108],"the":[26,46,59,78,87,94,97,122,125,127,131,148,167,175,183,188],"networks.":[28],"has":[31,173],"demand":[33,115],"specified":[34],"as":[35],"pair":[37],"vertices":[39],"\u2039u,":[40],"v\u203a,":[41],"along":[42],"with":[43],"profit;":[45],"wishes":[48],"to":[49,62,68,86,92,121,133,162],"send":[50],"data":[51],"between":[52],"u":[53,74],"v.":[55],"Towards":[56],"that":[57,141],"goal,":[58],"needs":[61],"select":[63],"network":[66,119],"accessible":[67,120],"it":[69],"path":[72],"connecting":[73],"v":[76],"within":[77],"selected":[79,114],"network.":[80],"The":[81,138,159],"requires":[83],"exclusive":[84],"chosen":[88,153],"path,":[89],"in":[90,178],"order":[91],"route":[93],"data.":[95],"Thus,":[96],"are":[99,191,201],"competing":[100],"for":[101,135,142,182,203],"routes/channels.":[102],"A":[103],"feasible":[104],"solution":[105,128,165],"selects":[106],"demands":[110,145],"schedules":[112],"each":[113],"on":[116,147],"owning":[124],"demand;":[126],"also":[129],"specifies":[130],"paths":[132,154,193],"use":[134],"this":[136,204],"purpose.":[137],"requirement":[139],"is":[140,161],"any":[143],"two":[144],"scheduled":[146],"same":[149],"network,":[151],"their":[152],"must":[155],"be":[156],"edge":[157],"disjoint.":[158],"goal":[160],"output":[163],"having":[166],"maximum":[168],"aggregate":[169],"profit.":[170],"Prior":[171],"work":[172],"addressed":[174],"above":[176],"problem":[177],"distibuted":[180],"setting":[181],"special":[184],"case":[185],"where":[186],"all":[187],"simply":[192],"(i.e,":[194],"line-networks).":[195],"Distributed":[196],"constant":[197],"factor":[198],"approximation":[199],"algorithms":[200],"known":[202],"case.":[205]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}