{"id":"https://openalex.org/W2083372144","doi":"https://doi.org/10.1109/glocom.2011.6133878","title":"Efficient Flow Allocation Algorithms for In-Network Function Computation","display_name":"Efficient Flow Allocation Algorithms for In-Network Function Computation","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2083372144","doi":"https://doi.org/10.1109/glocom.2011.6133878","mag":"2083372144"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2011.6133878","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2011.6133878","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","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/A5051842127","display_name":"Virag Shah","orcid":"https://orcid.org/0000-0002-3930-0348"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"V. Shah","raw_affiliation_strings":["Department of ECE, University of Texas, Austin, USA","[Department of ECE, University of Texas at Austin, Austin, TX, USA]"],"affiliations":[{"raw_affiliation_string":"Department of ECE, University of Texas, Austin, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"[Department of ECE, University of Texas at Austin, Austin, TX, USA]","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064926409","display_name":"Bikash Kumar Dey","orcid":"https://orcid.org/0000-0003-0333-2257"},"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":"B. K. Dey","raw_affiliation_strings":["Department of Electrical Engineering, IIT Bombay, India","Dept. of Electr. Eng., IIT Bombay, Mumbai, India"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, IIT Bombay, India","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"Dept. of Electr. Eng., 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, India","Dept. of Electr. Eng., IIT Bombay, Mumbai, India"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, IIT Bombay, India","institution_ids":["https://openalex.org/I162827531"]},{"raw_affiliation_string":"Dept. of Electr. Eng., IIT Bombay, Mumbai, India","institution_ids":["https://openalex.org/I162827531"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5051842127"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.3501,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63212217,"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":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9984999895095825,"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.9984999895095825,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976999759674072,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9973999857902527,"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.6990740895271301},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6167922616004944},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5063685178756714},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44652581214904785},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44582781195640564},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.44464200735092163},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4194675087928772},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3704211115837097},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24573016166687012}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6990740895271301},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6167922616004944},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5063685178756714},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44652581214904785},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44582781195640564},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.44464200735092163},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4194675087928772},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3704211115837097},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24573016166687012},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2011.6133878","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2011.6133878","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1768290500","https://openalex.org/W2035144082","https://openalex.org/W2045603582","https://openalex.org/W2053269541","https://openalex.org/W2076680677","https://openalex.org/W2114856692","https://openalex.org/W2123976939","https://openalex.org/W2129119419","https://openalex.org/W2152556909","https://openalex.org/W2164651000","https://openalex.org/W2165956524","https://openalex.org/W2340787257","https://openalex.org/W2611147814","https://openalex.org/W2912956481","https://openalex.org/W2964116608"],"related_works":["https://openalex.org/W4231775656","https://openalex.org/W2046435967","https://openalex.org/W2383646825","https://openalex.org/W2371018915","https://openalex.org/W2354191502","https://openalex.org/W1972225038","https://openalex.org/W3134658850","https://openalex.org/W2355938171","https://openalex.org/W2780079842","https://openalex.org/W2170725231"],"abstract_inverted_index":{"We":[0,13,163],"consider":[1,14],"in-network":[2],"computation":[3,70,181],"of":[4,28,48,62,91,98,142,156,160,167,175],"an":[5,9,146],"arbitrary":[6,10,46],"function":[7,47,64],"over":[8],"communication":[11],"network.":[12],"the":[15,63,88],"same":[16],"model":[17],"as":[18,105],"our":[19,78,168],"earlier":[20,79],"work":[21],"in":[22,101,119,153],"[1].":[23],"The":[24,60],"given":[25,69,184],"network":[26,155],"consists":[27],"directed/undirected":[29],"links":[30],"with":[31,109,182,190],"capacity":[32],"constraints,":[33],"some":[34],"source":[35],"nodes":[36],"which":[37,115],"generate":[38],"data,":[39],"and":[40,93,187],"other":[41,171],"intermediate":[42],"forwarding":[43],"nodes.":[44,194],"An":[45],"this":[49,102,123],"distributed":[50],"data":[51],"is":[52,65,159],"to":[53,86,106,131,135,148,170,188],"be":[54,117],"computed":[55],"at":[56,193],"a":[57,68,74,83,96,110,127,140,150,154,183],"terminal":[58],"node.":[59],"structure":[61],"described":[66],"by":[67,73],"schema":[71],"represented":[72],"directed":[75],"tree.":[76],"In":[77,122],"work,":[80],"we":[81,125,144],"presented":[82],"linear":[84,113,137],"program":[85,114],"define":[87],"maximum":[89],"rate":[90],"computation,":[92],"then":[94,164],"introduced":[95],"notion":[97],"flow-conservation":[99,111],"suitable":[100],"context":[103],"so":[104],"come":[107],"up":[108],"based":[112],"can":[116],"solved":[118],"polynomial":[120],"time.":[121],"paper,":[124],"develop":[126],"combinatorial":[128],"primal-dual":[129],"algorithm":[130,147],"obtain":[132],"(1-\u2208)-approximate":[133],"solutions":[134],"these":[136],"programs.":[138],"As":[139],"part":[141],"this,":[143],"present":[145],"find":[149],"minimum-cost":[151],"embedding":[152],"weighted":[157],"links--which":[158],"independent":[161],"interest.":[162],"describe":[165],"application":[166],"techniques":[169],"practically":[172],"interesting":[173],"problems":[174],"multiple":[176],"terminals":[177],"wanting":[178],"different":[179],"functions,":[180],"desired":[185],"precision,":[186],"networks":[189],"energy":[191],"constraints":[192]},"counts_by_year":[{"year":2016,"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"}
