{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T21:54:44Z","timestamp":1775253284353,"version":"3.50.1"},"reference-count":42,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/infocom.2018.8486419","type":"proceedings-article","created":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T14:45:36Z","timestamp":1539873936000},"page":"234-242","source":"Crossref","is-referenced-by-count":12,"title":["Traffic Engineering with Precomputed Pathbooks"],"prefix":"10.1109","author":[{"given":"Mathieu","family":"Leconte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Apostolos","family":"Destounis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"ref38","article-title":"Coordinate Descent Converges Faster with the Gauss-southwell Rule Than Random Selection","author":"nutini","year":"2015","journal-title":"ICML"},{"key":"ref33","article-title":"Projection Onto A Simplex","author":"chen","year":"2011","journal-title":"ArXiv e-prints"},{"key":"ref32","article-title":"Subgradient methods","author":"boyd","year":"0","journal-title":"lecture notes of EE392o Stanford University Autumn Quarter 2003"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1975.21"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/11671411_19"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/100802001"},{"key":"ref36","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref34","article-title":"Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application","author":"wang","year":"2013","journal-title":"ArXiv e-prints"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159926"},{"key":"ref40","article-title":"Monotone closure of relaxed constraints in submodular optimization: Connections between minimization and maximization: Extended version","author":"iyer","year":"2014","journal-title":"UAI"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.296"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/NGI.2009.5175781"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.815299"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1167-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.05.014"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181881"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(03)00346-3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780599"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.52"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111341"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637213"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","article-title":"SNDlib 1.0-Survivable Network Design Library","author":"orlowski","year":"2010","journal-title":"Networks"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2008.4483669"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/1300000007"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1145\/2774993.2775068","article-title":"Towards accurate online traffic matrix estimation in software-defined networks","author":"gong","year":"2015","journal-title":"Proc SOSR"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/sj.jors.2600523"},{"key":"ref8","article-title":"Boltzmann meets Nash: Energy-efficient routing in optical networks under uncertainty","volume":"abs 1605 1451","author":"mertikopoulos","year":"2016","journal-title":"CoRR"},{"key":"ref7","first-page":"1","article-title":"Resource allocation and cross-layer control in wireless networks","author":"georgiadis","year":"2006","journal-title":"Found Trends Netw"},{"key":"ref2","author":"foerster","year":"2016","journal-title":"Survey of consistent network updates"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1324215.1324236"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863991"},{"key":"ref22","article-title":"Semi-oblivious routing: lower bounds","author":"hajiaghayi","year":"2007","journal-title":"ACM SODA"},{"key":"ref21","article-title":"On optimal routing with multiple traffic matrices","author":"zhang","year":"2005","journal-title":"IEEE INFOCOM"},{"key":"ref42","author":"gary","year":"1979","journal-title":"Computers and intractability A guide to the theory of rip-completeness"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2002.1081765"},{"key":"ref41","article-title":"Fast semidifferential-based submodular function optimization: Extended version","author":"iyer","year":"2013","journal-title":"ICML"},{"key":"ref23","author":"kumar","year":"2016","journal-title":"Kulfi Robust traffic engineering using semi-oblivious routing"},{"key":"ref26","author":"ahuja","year":"1993","journal-title":"Network Flows"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CloudNet.2015.7335301"}],"event":{"name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","location":"Honolulu, HI","start":{"date-parts":[[2018,4,16]]},"end":{"date-parts":[[2018,4,19]]}},"container-title":["IEEE INFOCOM 2018 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8464035\/8485803\/08486419.pdf?arnumber=8486419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T20:40:09Z","timestamp":1775248809000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8486419\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/infocom.2018.8486419","relation":{},"subject":[],"published":{"date-parts":[[2018,4]]}}}