{"id":"https://openalex.org/W2962796701","doi":"https://doi.org/10.1109/tnet.2017.2695578","title":"On the Maximum Rate of Networked Computation in a Capacitated Network","display_name":"On the Maximum Rate of Networked Computation in a Capacitated Network","publication_year":2017,"publication_date":"2017-06-05","ids":{"openalex":"https://openalex.org/W2962796701","doi":"https://doi.org/10.1109/tnet.2017.2695578","mag":"2962796701"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2017.2695578","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2017.2695578","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","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/A5031181235","display_name":"Pooja Vyavahare","orcid":"https://orcid.org/0009-0009-5135-091X"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]},{"id":"https://openalex.org/I9579091","display_name":"Indian Institute of Technology Mandi","ror":"https://ror.org/05r9r2f34","country_code":"IN","type":"education","lineage":["https://openalex.org/I9579091"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Pooja Vyavahare","raw_affiliation_strings":["Department of Electrical Engineering, IIT Bombay, Mumbai, India","School of Computing and Electrical Engineering, IIT Mandi, Mandi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, IIT Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"School of Computing and Electrical Engineering, IIT Mandi, Mandi, India","institution_ids":["https://openalex.org/I9579091"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083072245","display_name":"Nutan Limaye","orcid":"https://orcid.org/0000-0002-0238-1674"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Nutan Limaye","raw_affiliation_strings":["Department of Computer Science and Engineering, IIT Bombay, Mumbai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, IIT Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041941673","display_name":"Ajit A. Diwan","orcid":"https://orcid.org/0000-0001-9381-7164"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ajit A. Diwan","raw_affiliation_strings":["Department of Computer Science and Engineering, IIT Bombay, Mumbai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, IIT Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017359920","display_name":"D. Manjunath","orcid":"https://orcid.org/0000-0001-7302-284X"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"D. Manjunath","raw_affiliation_strings":["Department of Electrical Engineering, IIT Bombay, Mumbai, India"],"raw_orcid":"https://orcid.org/0000-0001-7302-284X","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, IIT Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30297752,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"4","first_page":"2444","last_page":"2458"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994999766349792,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9987999796867371,"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.6234769225120544},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.5939423441886902},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5577598810195923},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.545105516910553},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5062021613121033},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49235260486602783},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4677242040634155},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.443593829870224},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4273565709590912},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4220200181007385},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3639397919178009},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.298490971326828},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2969846725463867}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6234769225120544},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.5939423441886902},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5577598810195923},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.545105516910553},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5062021613121033},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49235260486602783},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4677242040634155},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.443593829870224},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4273565709590912},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4220200181007385},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3639397919178009},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.298490971326828},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2969846725463867},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tnet.2017.2695578","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2017.2695578","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"},{"id":"pmh:oai:dsapce.library.iitb.ac.in:123456789/21253","is_oa":false,"landing_page_url":"http://doi.org/10.1109/TNET.2017.2695578","pdf_url":null,"source":{"id":"https://openalex.org/S4306400899","display_name":"DSpace (IIT Bombay)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I162827531","host_organization_name":"Indian Institute of Technology Bombay","host_organization_lineage":["https://openalex.org/I162827531"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321027","display_name":"Indo-French Centre for the Promotion of Advanced Research","ror":"https://ror.org/017aem598"},{"id":"https://openalex.org/F4320334760","display_name":"German Academic Exchange Service New Delhi","ror":"https://ror.org/039djdh30"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W1527607312","https://openalex.org/W1966140358","https://openalex.org/W1967786783","https://openalex.org/W1990395546","https://openalex.org/W2001988223","https://openalex.org/W2003623610","https://openalex.org/W2003858189","https://openalex.org/W2011039300","https://openalex.org/W2025896589","https://openalex.org/W2035575256","https://openalex.org/W2035908129","https://openalex.org/W2038837798","https://openalex.org/W2041754927","https://openalex.org/W2047221789","https://openalex.org/W2047276487","https://openalex.org/W2052844078","https://openalex.org/W2055636480","https://openalex.org/W2061857234","https://openalex.org/W2062502830","https://openalex.org/W2070395973","https://openalex.org/W2085412609","https://openalex.org/W2093701766","https://openalex.org/W2100830825","https://openalex.org/W2101246424","https://openalex.org/W2101271940","https://openalex.org/W2102474262","https://openalex.org/W2104496515","https://openalex.org/W2123976939","https://openalex.org/W2129119419","https://openalex.org/W2142268056","https://openalex.org/W2144974502","https://openalex.org/W2149065651","https://openalex.org/W2152986618","https://openalex.org/W2153825340","https://openalex.org/W2159316800","https://openalex.org/W2170513023","https://openalex.org/W2173213060","https://openalex.org/W2249739104","https://openalex.org/W2963292060","https://openalex.org/W3098321199","https://openalex.org/W4292230561","https://openalex.org/W6642156526","https://openalex.org/W6651411529","https://openalex.org/W6660278813","https://openalex.org/W6662227430","https://openalex.org/W6665976465","https://openalex.org/W6675151590"],"related_works":["https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342"],"abstract_inverted_index":{"We":[0,65,93,108,124,156],"are":[1],"given":[2,58],"a":[3,42,60,69,119,166,181,184,187,199],"capacitated":[4],"communication":[5,72],"network":[6,37,76,152,172,196],"and":[7,38,71,150,204],"several":[8],"infinite":[9],"sequences":[10],"of":[11,15,27,81,83,98,186,202,225],"source":[12,29],"data":[13,30],"each":[14],"which":[16],"is":[17,31,46,57,115,132,176,180],"available":[18,40],"at":[19,41],"some":[20],"node":[21,44],"in":[22,35,74,162],"the":[23,28,36,49,55,75,79,84,96,100,105,129,142,151,171,194],"network.":[24,50],"A":[25],"function":[26,56,85,89,189],"to":[32,53,67,77,117,183,213],"be":[33],"computed":[34],"made":[39],"sink":[43],"that":[45,110,127],"also":[47],"on":[48],"The":[51],"schema":[52],"compute":[54],"as":[59],"directed":[61],"acyclic":[62],"graph":[63],"(DAG).":[64],"want":[66],"generate":[68],"computation":[70,82],"schedule":[73,103,114],"maximize":[78],"rate":[80,101,131],"for":[86,104,170,193,222],"an":[87,112],"arbitrary":[88],"(represented":[90],"by":[91],"DAG).":[92],"first":[94],"analyze":[95],"complexity":[97],"finding":[99,111,128],"maximizing":[102],"general":[106,195],"DAG.":[107],"show":[109],"optimal":[113],"equivalent":[116,206],"solving":[118],"packing":[120,138,207],"linear":[121],"program":[122],"(LP).":[123],"then":[125,157],"prove":[126],"maximum":[130],"MAX":[133],"SNP-hard":[134],"(by":[135],"analyzing":[136],"this":[137,211],"LP)":[139],"even":[140],"when":[141],"DAG":[143],"has":[144,153],"bounded":[145,147],"degree,":[146],"edge":[148],"weights":[149],"three":[154],"vertices.":[155],"consider":[158],"special":[159,223],"cases":[160],"arising":[161],"practical":[163],"situations.":[164],"First,":[165],"polynomial":[167],"time":[168],"algorithm":[169,179],"with":[173],"two":[174],"vertices":[175],"presented.":[177],"This":[178],"reduction":[182],"version":[185],"submodular":[188],"minimization":[190],"problem.":[191],"Next,":[192],"we":[197,218],"describe":[198],"restricted":[200],"class":[201],"schedules":[203],"its":[205],"LP.":[208],"By":[209],"relating":[210],"LP":[212],"minimum":[214],"cost":[215],"embedding":[216],"problem,":[217],"present":[219],"approximation":[220],"algorithms":[221],"classes":[224],"DAGs.":[226]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}