{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:11:15Z","timestamp":1725541875938},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/cdc.2016.7798259","type":"proceedings-article","created":{"date-parts":[[2017,1,5]],"date-time":"2017-01-05T12:11:18Z","timestamp":1483618278000},"page":"135-140","source":"Crossref","is-referenced-by-count":3,"title":["Online algorithms for network formation"],"prefix":"10.1109","author":[{"given":"De","family":"Meng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maryam","family":"Fazel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehran","family":"Mesbahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/050645452"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1080.0363"},{"key":"ref12","article-title":"Online packing and covering framework with convex objectives","author":"buchbinder","year":"2014","journal-title":"arXiv preprint arXiv 1412 8347"},{"key":"ref13","article-title":"A dynamic near-optimal algorithm for online linear programming","author":"agrawal","year":"2009","journal-title":"arXiv preprint arXiv 0911 2974"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.93"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2015.0742"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.861710"},{"key":"ref18","article-title":"Worst case competitive analysis of greedy algorithm for online conic optimization","author":"eghbali","year":"2016","journal-title":"To appear in CDC"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1515\/9781400835355"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377282"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0040-9383(93)90035-T"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2011.2157884"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144503423264"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00222-002-0249-4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511614385"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1111\/1468-0262.00155"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2205429"},{"key":"ref20","article-title":"Designing smoothing functions for improved worst-case competitive ratio in online optimization","author":"eghbali","year":"2016","journal-title":"to appear in Proc NIPS"}],"event":{"name":"2016 IEEE 55th Conference on Decision and Control (CDC)","start":{"date-parts":[[2016,12,12]]},"location":"Las Vegas, NV, USA","end":{"date-parts":[[2016,12,14]]}},"container-title":["2016 IEEE 55th Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7786694\/7798233\/07798259.pdf?arnumber=7798259","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T23:17:02Z","timestamp":1506986222000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7798259\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/cdc.2016.7798259","relation":{},"subject":[],"published":{"date-parts":[[2016,12]]}}}