{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:32:07Z","timestamp":1725795127103},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080154"},{"type":"electronic","value":"9783319080161"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_20","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T00:18:07Z","timestamp":1401409087000},"page":"216-228","source":"Crossref","is-referenced-by-count":0,"title":["Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost"],"prefix":"10.1007","author":[{"given":"Yangguang","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fa","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Multicommodity Flows. In: Network Flows: Theory, Algorithms, and Applications, pp. 649\u2013694. Prentice Hall (1993)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Andrews, M., Antonakopoulos, S., Zhang, L.: Minimum-cost network design with (dis)economies of scale. In: 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 585\u2013592 (October 2010)","DOI":"10.1109\/FOCS.2010.61"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/TNET.2011.2159864","volume":"20","author":"M. Andrews","year":"2012","unstructured":"Andrews, M., Anta, A.F., Zhang, L., Zhao, W.: Routing for power minimization in the speed scaling model. IEEE\/ACM Transactions on Networking\u00a020(1), 285\u2013294 (2012)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"20_CR4","unstructured":"Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, FOCS 1996. IEEE Computer Society (1996)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Vijayaraghavan, A.: Approximating matrix p-norms. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 497\u2013511. SIAM (2011)","DOI":"10.1137\/1.9781611973082.40"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/FOCS.2009.52","volume-title":"Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009","author":"M. Englert","year":"2009","unstructured":"Englert, M., R\u00e4cke, H.: Oblivious routing for the lp-norm. In: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pp. 32\u201340. IEEE Computer Society, Washington, DC (2009)"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, STOC 2003, pp. 448\u2013455. ACM (2003)","DOI":"10.1145\/780542.780608"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00453-010-9455-4","volume":"61","author":"N. Goyal","year":"2011","unstructured":"Goyal, N., Olver, N., Shepherd, F.: Dynamic vs. oblivious routing in network design. Algorithmica\u00a061(1), 161\u2013173 (2011)","journal-title":"Algorithmica"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1145\/1109557.1109665","volume-title":"Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA 2006","author":"A. Gupta","year":"2006","unstructured":"Gupta, A., Hajiaghayi, M.T., R\u00e4cke, H.: Oblivious network design. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA 2006, pp. 970\u2013979. ACM, New York (2006)"},{"key":"20_CR10","unstructured":"Harsha, P., Hayes, T.P., Narayanan, H., R\u00e4cke, H., Radhakrishnan, J.: Minimizing average latency in oblivious routing. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 200\u2013207. Society for Industrial and Applied Mathematics (2008)"},{"key":"20_CR11","unstructured":"Intel: Enhanced intel speedstep technology for the intel pentium m processor. Intel White Paper 301170-001 (2004)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Lawler, G., Narayanan, H.: Mixing times and lp bounds for oblivious routing. In: Proceedings of the 5th Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 66\u201374 (2009)","DOI":"10.1137\/1.9781611972993.10"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"R\u00e4cke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 255\u2013264. ACM (2008)","DOI":"10.1145\/1374376.1374415"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-03073-4_43","volume-title":"Mathematical Theory and Computational Practice","author":"H. R\u00e4cke","year":"2009","unstructured":"R\u00e4cke, H.: Survey on oblivious routing strategies. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE 2009. LNCS, vol.\u00a05635, pp. 419\u2013429. Springer, Heidelberg (2009)"},{"issue":"12","key":"20_CR15","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1109\/JLT.2006.885774","volume":"24","author":"R.S. Tucker","year":"2006","unstructured":"Tucker, R.S.: The role of optics and electronics in high-capacity routers. Journal of Lightwave Technology\u00a024(12), 4655\u20134673 (2006)","journal-title":"Journal of Lightwave Technology"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Wierman, A., Andrew, L., Tang, A.: Power-aware speed scaling in processor sharing systems. In: IEEE INFOCOM 2009, pp. 2007\u20132015 (April 2009)","DOI":"10.1109\/INFCOM.2009.5062123"},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1364\/JOCN.1.000069","volume":"1","author":"G. Zervas","year":"2009","unstructured":"Zervas, G., De Leenheer, M., Sadeghioon, L., Klonidis, D., Qin, Y., Nejabati, R., Simeonidou, D., Develder, C., Dhoedt, B., Demeester, P.: Multi-granular optical cross-connect: Design, analysis, and demonstration. IEEE\/OSA Journal of Optical Communications and Networking\u00a01(1), 69\u201384 (2009)","journal-title":"IEEE\/OSA Journal of Optical Communications and Networking"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08016-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T19:08:45Z","timestamp":1558897725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}