{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:35:51Z","timestamp":1729672551823,"version":"3.28.0"},"reference-count":47,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1109\/ita.2018.8503261","type":"proceedings-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T23:42:52Z","timestamp":1540510972000},"page":"1-10","source":"Crossref","is-referenced-by-count":1,"title":["A Parallelizable Acceleration Framework for Packing Linear Programs"],"prefix":"10.1109","author":[{"given":"Palma","family":"London","sequence":"first","affiliation":[]},{"given":"Shai","family":"Vardi","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Wierman","sequence":"additional","affiliation":[]},{"given":"Hanling","family":"Yi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"2895","article-title":"Any approximate, efficient LP solver for LP rounding","author":"sridhar","year":"2013","journal-title":"Proc of NIPS"},{"key":"ref38","first-page":"1273","article-title":"Linear programming analysis of loopy belief propagation for weighted matching","author":"sanghavi","year":"2008","journal-title":"Proc of NIPS"},{"key":"ref33","first-page":"1043","article-title":"Message passing for graph-structured linear programs: Proximal methods and rounding schemes","volume":"11","author":"ravikumar","year":"2010","journal-title":"JMLR"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/moor.20.2.257"},{"key":"ref31","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02772-1","article-title":"Arrangements of Hyperplanes","author":"orlik","year":"1992","journal-title":"Grundlehren der mathematis-chen Wissenschaften"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2164020"},{"key":"ref37","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v31i1.10859","article-title":"Online active linear regression via thresholding","author":"riquelme","year":"2017","journal-title":"Proc Of AAAI"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2404451"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787481"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700379383"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015444"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582131"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447293"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1561\/0400000024"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2012.06.040"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MOBHOC.2000.869228"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111771"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1566374.1566384"},{"key":"ref28","first-page":"445","article-title":"Node-based learning of multiple gaussian graphical models","volume":"15","author":"mohan","year":"2014","journal-title":"JMLR"},{"key":"ref4","article-title":"Reining in the outliers in map-reduce clusters using mantri","author":"ananthanarayanan","year":"2010","journal-title":"Proc of OSDI"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_55"},{"key":"ref3","first-page":"1439","article-title":"Using optimization to break the epsilon barrier: A faster and simpler width-independent algorithm for solving positive linear programs in parallel","author":"allen-zhu","year":"2015","journal-title":"Proc of SODA"},{"key":"ref6","first-page":"289","article-title":"Grass: Trimming stragglers in approximation analytics","author":"ananthanarayanan","year":"2014","journal-title":"Proc of NSDI"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"ref5","first-page":"185","article-title":"Effective straggler mitigation: Attack of the clones","author":"ananthanarayanan","year":"2013","journal-title":"Proc of NSDI"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.5.716"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374476"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2014.1289"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90020-1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792236237"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asm018"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0502269102"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959930"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.6.992"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/501158.501172"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref42","article-title":"Weak Convergence and Empirical Processes With Applications to Statistics","author":"vander vaart","year":"1996","journal-title":"wSpringer Series in Statistics"},{"journal-title":"SNAP Datasets Stanford large network da taset collection","year":"2014","author":"leskovec","key":"ref24"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009209"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-008-0253-6"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167211"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"journal-title":"Distributed optimization via local computation algorithms","year":"2017","author":"london","key":"ref25"}],"event":{"name":"2018 Information Theory and Applications Workshop (ITA)","start":{"date-parts":[[2018,2,11]]},"location":"San Diego, CA","end":{"date-parts":[[2018,2,16]]}},"container-title":["2018 Information Theory and Applications Workshop (ITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8486613\/8502949\/08503261.pdf?arnumber=8503261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T17:50:14Z","timestamp":1662313814000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8503261\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/ita.2018.8503261","relation":{},"subject":[],"published":{"date-parts":[[2018,2]]}}}