{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:20:28Z","timestamp":1740133228655,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T00:00:00Z","timestamp":1501545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"DST"},{"name":"ITRA"},{"DOI":"10.13039\/501100001650","name":"DAAD","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001650","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001852","name":"CEFIPRA","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001852","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1109\/tnet.2017.2695578","type":"journal-article","created":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T18:09:12Z","timestamp":1496686152000},"page":"2444-2458","source":"Crossref","is-referenced-by-count":0,"title":["On the Maximum Rate of Networked Computation in a Capacitated Network"],"prefix":"10.1109","volume":"25","author":[{"given":"Pooja","family":"Vyavahare","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nutan","family":"Limaye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajit A.","family":"Diwan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7302-284X","authenticated-orcid":false,"given":"D.","family":"Manjunath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1079","article-title":"Approximate classification via earthmover metrics","author":"archer","year":"2004","journal-title":"Proc 15th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/SPCOM.2014.6984006"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/32.41334"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/12.8704"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.233840"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/TSE.1981.226469","article-title":"a shortest tree algorithm for optimal assignments across space and time in a distributed processor system","volume":"se 7","author":"bokhari","year":"1981","journal-title":"IEEE Transactions on Software Engineering"},{"key":"ref37","first-page":"8","article-title":"Approximation algorithms for the 0-extension problem","author":"calinescu","year":"2001","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms"},{"journal-title":"On Selection of the Optimal Embeddings of General Dag Functions","year":"2014","author":"vyavahare","key":"ref36"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132595"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1997.0154"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130408"},{"key":"ref40","first-page":"41","article-title":"Lower bounds based on the exponential time hypothesis","volume":"105","author":"lokshtanov","year":"2011","journal-title":"Bull EATCS"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2168902"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095070"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2169532"},{"key":"ref14","first-page":"137","article-title":"MapReduce: Simplified data processing on large clusters","author":"dean","year":"2004","journal-title":"Proc of the 5th Symp on Oper Syst Design and Implementation (OSDI)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"ref16","first-page":"1143","article-title":"Joint scheduling of processing and shuffle phases in MapReduce systems","author":"chen","year":"2012","journal-title":"Proc IEEE InfoCom"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2013.08.013"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130409"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2345257"},{"article-title":"Greedy is good: On service tree placement for in-network stream processing","year":"2005","author":"abrams","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2006.1632656"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1023\/B:TELS.0000029048.24942.65"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2479942.2479950"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909156"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.168"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498546"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.59"},{"key":"ref7","first-page":"1056","article-title":"A tight lower bound for parity in noisy communication networks","author":"dutta","year":"2008","journal-title":"Proc 19th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.151"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2293214"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"ref20","first-page":"266","article-title":"Packing Steiner trees","author":"jain","year":"2003","journal-title":"Proc 10th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2317316"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792225297"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48523-6_17"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2445835"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.1989"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8011587\/07938646.pdf?arnumber=7938646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T17:04:17Z","timestamp":1642007057000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7938646\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":41,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2017.2695578","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2017,8]]}}}