{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:45:42Z","timestamp":1742971542255,"version":"3.40.3"},"publisher-location":"Cham","reference-count":66,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319919072"},{"type":"electronic","value":"9783319919089"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-91908-9_10","type":"book-chapter","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T05:05:00Z","timestamp":1570165500000},"page":"161-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Green Computing Algorithmics"],"prefix":"10.1007","author":[{"given":"Kirk","family":"Pruhs","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,5]]},"reference":[{"key":"10_CR1","unstructured":"Vision and roadmap: routing telecom and data centers toward efficient energy use. In: Proceedings of Vision and Roadmap Workshop on Routing Telecom and Data Centers Toward Efficient Energy Use, May 2009"},{"issue":"5","key":"10_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1735223.1735245","volume":"53","author":"S Albers","year":"2010","unstructured":"Albers, S.: Energy-efficient algorithms. Commun. ACM 53(5), 86\u201396 (2010)","journal-title":"Commun. ACM"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Anand, S., Garg, N., Kumar, A.: Resource augmentation for weighted flow-time explained by dual fitting. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1228\u20131241 (2012)","DOI":"10.1137\/1.9781611973099.97"},{"key":"10_CR4","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":"10_CR5","doi-asserted-by":"crossref","unstructured":"Andrews, M., Antonakopoulos, S., Zhang, L.: Minimum-cost network design with (dis)economies of scale. In: IEEE Symposium on Foundations of Computer Science, pp. 585\u2013592 (2010)","DOI":"10.1109\/FOCS.2010.61"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Andrews, M., Fern\u00e1ndez, A., Zhang, L., Zhao, W.: Routing for energy minimization in the speed scaling model. In: INFOCOM, pp. 2435\u20132443 (2010)","DOI":"10.1109\/INFCOM.2010.5462071"},{"key":"10_CR7","unstructured":"Antoniadis, A., Barcelo, N., Consuegra, M., Kling, P., Nugent, M., Pruhs, K., Scquizzato, M.: Efficient computation of optimal energy and fractional weighted flow trade-off schedules. In: Symposium on Theoretical Aspects of Computer Science (2014)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-662-49529-2_6","volume-title":"LATIN 2016: Theoretical Informatics","author":"A Antoniadis","year":"2016","unstructured":"Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Schewior, K., Scquizzato, M.: Chasing convex bodies and functions. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 68\u201381. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49529-2_6"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Scquizzato, M.: Complexity-theoretic obstacles to achieving energy savings with near-threshold computing. In: International Green Computing Conference, pp. 1\u20138 (2014)","DOI":"10.1109\/IGCC.2014.7039142"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Scquizzato, M.: Energy-efficient circuit design. In: Innovations in Theoretical Computer Science, pp. 303\u2013312 (2014)","DOI":"10.1145\/2554797.2554826"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Antoniadis, A., Im, S., Krishnaswamy, R., Moseley, B., Nagarajan, V., Pruhs, K., Stein, C.: Energy efficient virtual circuit routing. In: ACM-SIAM Symposium on Discrete Algorithms (2014)","DOI":"10.1137\/1.9781611973402.84"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-34862-4_3","volume-title":"Design and Analysis of Algorithms","author":"N Bansal","year":"2012","unstructured":"Bansal, N., Gupta, A., Krishnaswamy, R., Nagarajan, V., Pruhs, K., Stein, C.: Multicast routing for energy minimization using speed scaling. In: Even, G., Rawitz, D. (eds.) MedAlg 2012. LNCS, vol. 7659, pp. 37\u201351. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-34862-4_3"},{"key":"10_CR13","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":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1206035.1206038","volume":"54","author":"N Bansal","year":"2007","unstructured":"Bansal, N., Kimbrel, T., Pruhs, K.: Speed scaling to manage energy and temperature. J. ACM 54(1), 3 (2007)","journal-title":"J. ACM"},{"key":"10_CR15","first-page":"207","volume":"3","author":"N Barcelo","year":"2013","unstructured":"Barcelo, N., Cole, D., Letsios, D., Nugent, M., Pruhs, K.: Optimal energy trade-off schedules. Sustain. Comput.: Inf. Syst. 3, 207\u2013217 (2013)","journal-title":"Sustain. Comput.: Inf. Syst."},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-319-48749-6_38","volume-title":"Combinatorial Optimization and Applications","author":"N Barcelo","year":"2016","unstructured":"Barcelo, N., Kling, P., Nugent, M., Pruhs, K.: Optimal speed scaling with a solar cell. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 521\u2013535. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-48749-6_38"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-662-48054-0_7","volume-title":"Mathematical Foundations of Computer Science 2015","author":"N Barcelo","year":"2015","unstructured":"Barcelo, N., Kling, P., Nugent, M., Pruhs, K., Scquizzato, M.: On the complexity of speed scaling. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 75\u201389. Springer, Heidelberg (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-662-48054-0_7"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-662-48054-0_8","volume-title":"Mathematical Foundations of Computer Science 2015","author":"N Barcelo","year":"2015","unstructured":"Barcelo, N., Nugent, M., Pruhs, K., Scquizzato, M.: Almost all functions require exponential energy. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 90\u2013101. Springer, Heidelberg (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-662-48054-0_8"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Barcelo, N., Nugent, M., Pruhs, K., Scquizzato, M.: The power of heterogeneity in near-threshold computing. In: International Green and Sustainable Computing Conference, pp. 1\u20134 (2015)","DOI":"10.1109\/IGCC.2015.7393700"},{"issue":"5","key":"10_CR20","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":"10_CR21","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"},{"key":"10_CR22","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"4","key":"10_CR23","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"},{"issue":"3","key":"10_CR24","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/MM.2008.46","volume":"28","author":"FA Bower","year":"2008","unstructured":"Bower, F.A., Sorin, D.J., Cox, L.P.: The impact of dynamically heterogeneous multicore processors on thread scheduling. IEEE Micro 28(3), 17\u201325 (2008)","journal-title":"IEEE Micro"},{"issue":"6","key":"10_CR25","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.888701","volume":"20","author":"DM Brooks","year":"2000","unstructured":"Brooks, D.M., Bose, P., Schuster, S.E., Jacobson, H., Kudva, P.N., Buyuktosunoglu, A., Wellman, J.-D., Zyuban, V., Gupta, M., Cook, P.W.: Power-aware microarchitecture: design and modeling challenges for next-generation microprocessors. IEEE Micro 20(6), 26\u201344 (2000)","journal-title":"IEEE Micro"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Butts, J.A., Sohi, G.S.: A static power model for architects. In: ACM\/IEEE International Symposium on Microarchitecture, pp. 191\u2013201 (2000)","DOI":"10.1145\/360128.360148"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S., Shepherd, F.B.: Multicommodity flow, well-linked terminals, and routing problems. In: ACM Symposium on Theory of Computing, pp. 183\u2013192 (2005)","DOI":"10.1145\/1060590.1060618"},{"issue":"2","key":"10_CR28","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1109\/JPROC.2009.2034764","volume":"98","author":"RG Dreslinski","year":"2010","unstructured":"Dreslinski, R.G., Wieckowski, M., Blaauw, D., Sylvester, D., Mudge, T.N.: Near-threshold computing: reclaiming Moore\u2019s law through energy efficient integrated circuits. Proc. IEEE 98(2), 253\u2013266 (2010)","journal-title":"Proc. IEEE"},{"issue":"3","key":"10_CR29","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/MM.2012.17","volume":"32","author":"H Esmaeilzadeh","year":"2012","unstructured":"Esmaeilzadeh, H., Blem, E.R., Amant, R.S., Sankaralingam, K., Burger, D.: Dark silicon and the end of multicore scaling. IEEE Micro 32(3), 122\u2013134 (2012)","journal-title":"IEEE Micro"},{"issue":"6","key":"10_CR30","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":"10_CR31","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. Discret. Comput. Geom. 9, 293\u2013321 (1993)","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"10_CR32","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."},{"key":"10_CR33","unstructured":"G\u00e1cs, P.: Reliable computation. In: Algorithms in Informatics, vol. 2. ELTE E\u00f6tv\u00f6s Kiad\u00f3, Budapest (2005)"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Gupta, A., Im, S., Krishnaswamy, R., Moseley, B., Pruhs, K.: Scheduling heterogeneous processors isn\u2019t as easy as you think. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1242\u20131253 (2012)","DOI":"10.1137\/1.9781611973099.98"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-38016-7_15","volume-title":"Approximation and Online Algorithms","author":"A Gupta","year":"2013","unstructured":"Gupta, A., Krishnaswamy, R., Pruhs, K.: Online primal-dual for non-linear optimization with applications to speed scaling. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp. 173\u2013186. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-38016-7_15"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Im, S., Kulkarni, J., Munagala, K.: Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints. In: Symposium on Theory of Computing, pp. 313\u2013322 (2014)","DOI":"10.1145\/2591796.2591814"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Im, S., Kulkarni, J., Munagala, K., Pruhs, K.: Selfishmigrate: a scalable algorithm for non-clairvoyantly scheduling heterogeneous processors. In: Symposium on Foundations of Computer Science, pp. 531\u2013540 (2014)","DOI":"10.1109\/FOCS.2014.63"},{"issue":"2","key":"10_CR38","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/1998037.1998058","volume":"42","author":"S Im","year":"2011","unstructured":"Im, S., Moseley, B., Pruhs, K.: A tutorial on amortized local competitiveness in online scheduling. SIGACT News 42(2), 83\u201397 (2011)","journal-title":"SIGACT News"},{"issue":"2","key":"10_CR39","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1067309.1067324","volume":"36","author":"S Irani","year":"2005","unstructured":"Irani, S., Pruhs, K.: Algorithmic problems in power management. SIGACT News 36(2), 63\u201376 (2005)","journal-title":"SIGACT News"},{"issue":"4","key":"10_CR40","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1538902.1538903","volume":"56","author":"R Khandekar","year":"2009","unstructured":"Khandekar, R., Rao, S., Vazirani, U.V.: Graph partitioning using single commodity flows. J. ACM 56(4), 19 (2009)","journal-title":"J. ACM"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Nagarajan, V., Pruhs, K., Stein, C.: Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing (2014)","DOI":"10.1145\/2591796.2591831"},{"key":"10_CR42","doi-asserted-by":"crossref","unstructured":"Kumar, R., Tullsen, D.M., Jouppi, N.P.: Core architecture optimization for heterogeneous chip multiprocessors. In: International Conference on Parallel Architectures and Compilation Techniques, pp. 23\u201332. ACM (2006)","DOI":"10.1145\/1152154.1152162"},{"issue":"2","key":"10_CR43","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/1028176.1006707","volume":"32","author":"R Kumar","year":"2004","unstructured":"Kumar, R., Tullsen, D.M., Ranganathan, P., Jouppi, N.P., Farkas, K.I.: Single-ISA heterogeneous multi-core architectures for multithreaded workload performance. SIGARCH Comput. Archit. News 32(2), 64 (2004)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"10_CR44","volume-title":"Computer Networking: A Top-Down Approach","author":"JF Kurose","year":"2009","unstructured":"Kurose, J.F., Ross, K.W.: Computer Networking: A Top-Down Approach. Addison-Wesley Publishing Company, Boston (2009)"},{"issue":"6","key":"10_CR45","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"FT Leighton","year":"1999","unstructured":"Leighton, F.T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787\u2013832 (1999)","journal-title":"J. ACM"},{"key":"10_CR46","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":"10_CR47","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":"10_CR48","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":"10_CR49","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."},{"issue":"2","key":"10_CR50","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N Linial","year":"1995","unstructured":"Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica 15(2), 215\u2013245 (1995)","journal-title":"Combinatorica"},{"key":"10_CR51","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":"10_CR52","unstructured":"Merritt, R.: CPU designers debate multi-core future. EE Times, February 2008"},{"issue":"1","key":"10_CR53","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/L-CA.2006.6","volume":"5","author":"TY Morad","year":"2006","unstructured":"Morad, T.Y., Weiser, U.C., Kolodny, A., Valero, M., Ayguade, E.: Performance, power efficiency and scalability of asymmetric cluster chip multiprocessors. IEEE Comput. Archit. Lett. 5(1), 4 (2006)","journal-title":"IEEE Comput. Archit. Lett."},{"issue":"4","key":"10_CR54","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/2.917539","volume":"34","author":"T Mudge","year":"2001","unstructured":"Mudge, T.: Power: a first-class architectural design constraint. Computer 34(4), 52\u201358 (2001)","journal-title":"Computer"},{"key":"10_CR55","doi-asserted-by":"crossref","unstructured":"Pippenger, N.: On networks of noisy gates. In: Symposium on Foundations of Computer Science, pp. 30\u201338 (1985)","DOI":"10.1109\/SFCS.1985.41"},{"issue":"4","key":"10_CR56","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/1243401.1243411","volume":"34","author":"Kirk Pruhs","year":"2007","unstructured":"Pruhs, K.: Competitive online scheduling for server systems. In: Special Issue of SIGMETRICS Performance Evaluation Review on New Perspectives in Scheduling, no. 4 (2007)","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"10_CR57","unstructured":"Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004)"},{"issue":"3","key":"10_CR58","doi-asserted-by":"publisher","first-page":"38:1","DOI":"10.1145\/1367064.1367078","volume":"4","author":"K Pruhs","year":"2008","unstructured":"Pruhs, K., Uthaisombut, P., Woeginger, G.J.: Getting the best response for your erg. ACM Trans. Algorithms 4(3), 38:1\u201338:17 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"5","key":"10_CR59","doi-asserted-by":"publisher","first-page":"1856","DOI":"10.1137\/080715093","volume":"39","author":"S Rao","year":"2010","unstructured":"Rao, S., Zhou, S.: Edge disjoint paths in moderately connected graphs. SIAM J. Comput. 39(5), 1856\u20131887 (2010)","journal-title":"SIAM J. Comput."},{"key":"10_CR60","volume-title":"Thermal Management Handbook","author":"JE Sergent","year":"1998","unstructured":"Sergent, J.E., Krum, A.: Thermal Management Handbook. McGraw-Hill, New York (1998)"},{"key":"10_CR61","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/j.1538-7305.1949.tb03624.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: The synthesis of two-terminal switching circuits. Bell Syst. Tech. J. 28, 59\u201398 (1949)","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"10_CR62","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."},{"issue":"3","key":"10_CR63","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(84)90016-6","volume":"5","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: Short monotone formulae for the majority function. J. Algorithms 5(3), 363\u2013366 (1984)","journal-title":"J. Algorithms"},{"key":"10_CR64","first-page":"329","volume-title":"Automata Studies","author":"J Neumann von","year":"1956","unstructured":"von Neumann, J.: Probabilistic logics and the synthesis of reliable organisms from unreliable components. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 329\u2013378. Princeton University Press, Princeton (1956)"},{"key":"10_CR65","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":"10_CR66","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)"}],"container-title":["Lecture Notes in Computer Science","Computing and Software Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91908-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T20:10:13Z","timestamp":1570306213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91908-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783319919072","9783319919089"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91908-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}