乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:19:21Z","timestamp":1725851961590},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_6","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:09:41Z","timestamp":1458547781000},"page":"68-81","source":"Crossref","is-referenced-by-count":17,"title":["Chasing Convex Bodies and Functions"],"prefix":"10.1007","author":[{"given":"Antonios","family":"Antoniadis","sequence":"first","affiliation":[]},{"given":"Neal","family":"Barcelo","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Nugent","sequence":"additional","affiliation":[]},{"given":"Kirk","family":"Pruhs","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Schewior","sequence":"additional","affiliation":[]},{"given":"Michele","family":"Scquizzato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Andrew, L.L.H., Barman, S., Ligett, K., Lin, M., Meyerson, A., Roytman, A., Wierman, A.: A tale of two metrics: simultaneous bounds on competitiveness and regret. In: Conference on Learning Theory, pp. 741\u2013763 (2013)","DOI":"10.1145\/2465529.2465533"},{"key":"6_CR2","unstructured":"Andrew, L.L.H., Barman, S., Ligett, K., Lin, M., Meyerson, A., Roytman, A., Wierman, A.: A tale of two metrics: simultaneous bounds on competitiveness and regret. CoRR, abs\/1508.03769 (2015)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N., Buchbinder, N., Naor, J.: Towards the randomized k-server conjecture: a primal-dual approach. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 40\u201355 (2010)","DOI":"10.1137\/1.9781611973075.5"},{"key":"6_CR4","unstructured":"Bansal, N., Gupta, A., Krishnaswamy, R., Pruhs, K., Schewior, K., Stein, C.: A 2-competitive algorithm for online convex optimization with switching costs. In: Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 96\u2013109 (2015)"},{"issue":"5","key":"6_CR5","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1016\/j.jcss.2005.05.008","volume":"72","author":"Y Bartal","year":"2006","unstructured":"Bartal, Y., Bollob\u00e1s, B., Mendel, M.: Ramsey-type theorems for metric spaces with applications to online problems. J. Comput. Syst. Sci. 72(5), 890\u2013921 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Linial, N., Mendel, M., Naor, A.: On metric Ramsey-type phenomena. In: ACM Symposium on Theory of Computing, pp. 463\u2013472 (2003)","DOI":"10.1145\/780606.780610"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1145\/146585.146588","volume":"39","author":"A Borodin","year":"1992","unstructured":"Borodin, A., Linial, N., Saks, M.E.: An optimal on-line algorithm for metrical task system. J. ACM 39(4), 745\u2013763 (1992)","journal-title":"J. ACM"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Cot\u00e9, A., Meyerson, A., Poplawski, L.: Randomized \n \n \n \n $$k$$\n \n \n k\n \n \n -server on hierarchical binary trees. In: ACM Symposium on Theory of Computing, pp. 227\u2013234 (2008)","DOI":"10.1145\/1374376.1374411"},{"issue":"6","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1137\/S0097539700376159","volume":"32","author":"A Fiat","year":"2003","unstructured":"Fiat, A., Mendel, M.: Better algorithms for unfair metrical task systems and applications. SIAM J. Comput. 32(6), 1403\u20131422 (2003)","journal-title":"SIAM J. Comput."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF02189324","volume":"9","author":"J Friedman","year":"1993","unstructured":"Friedman, J., Linial, N.: On convex body chasing. Discrete Comput. Geom. 9, 293\u2013321 (1993)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.ipl.2008.03.025","volume":"108","author":"H Fujiwara","year":"2008","unstructured":"Fujiwara, H., Iwama, K., Yonezawa, K.: Online chasing problems for regular polygons. Inf. Process. Lett. 108(3), 155\u2013159 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"6_CR12","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/BF01189993","volume":"11","author":"AR Karlin","year":"1994","unstructured":"Karlin, A.R., Manasse, M.S., McGeoch, L.A., Owicki, S.S.: Competitive randomized algorithms for nonuniform problems. Algorithmica 11(6), 542\u2013571 (1994)","journal-title":"Algorithmica"},{"issue":"2\u20133","key":"6_CR13","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.tcs.2004.06.002","volume":"324","author":"E Koutsoupias","year":"2004","unstructured":"Koutsoupias, E., Taylor, D.S.: The CNN problem and other \n \n \n \n $$k$$\n \n \n k\n \n \n -server variants. Theor. Comput. Sci. 324(2\u20133), 347\u2013359 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Lin, M., Liu, Z., Wierman, A., Andrew, L.L.H.: Online algorithms for geographical load balancing. In: International Green Computing Conference, pp. 1\u201310 (2012)","DOI":"10.1109\/IGCC.2012.6322266"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Lin, M., Wierman, A., Andrew, L.L.H., Thereska, E.: Online dynamic capacity provisioning in data centers. In: Allerton Conference on Communication, Control, and Computing, pp. 1159\u20131163 (2011)","DOI":"10.1109\/Allerton.2011.6120298"},{"issue":"5","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1109\/TNET.2012.2226216","volume":"21","author":"M Lin","year":"2013","unstructured":"Lin, M., Wierman, A., Andrew, L.L.H., Thereska, E.: Dynamic right-sizing for power-proportional data centers. IEEE\/ACM Trans. Netw. 21(5), 1378\u20131391 (2013)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/2425248.2425275","volume":"40","author":"M Lin","year":"2012","unstructured":"Lin, M., Wierman, A., Roytman, A., Meyerson, A., Andrew, L.L.H.: Online optimization with switching cost. SIGMETRICS Perform. Eval. Rev. 40(3), 98\u2013100 (2012)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Liu, Z., Lin, M., Wierman, A., Low, S.H., Andrew, L.L.H.: Greening geographical load balancing. In: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 233\u2013244 (2011)","DOI":"10.1145\/1993744.1993767"},{"key":"6_CR19","volume-title":"Inequalities: Theory of Majorization and Its Application","author":"AW Marshall","year":"1979","unstructured":"Marshall, A.W., Olkin, I.: Inequalities: Theory of Majorization and Its Application. Academic Press, Cambridge (1979)"},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1137\/120885309","volume":"43","author":"R Sitters","year":"2014","unstructured":"Sitters, R.: The generalized work function algorithm is competitive for the generalized 2-server problem. SIAM J. Comput. 43(1), 96\u2013125 (2014)","journal-title":"SIAM J. Comput."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, M., Ciucu, F., Wierman, A., Lin, C.: Characterizing the impact of the workload on the value of dynamic resizing in data centers. In: IEEE INFOCOM, pp. 515\u2013519 (2013)","DOI":"10.1109\/INFCOM.2013.6566826"},{"key":"6_CR22","unstructured":"Wierman, A.: Personal Communication (2015)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T20:18:00Z","timestamp":1559420280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}