{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:44:03Z","timestamp":1725900243979},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_32","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T09:23:02Z","timestamp":1368004982000},"page":"366-377","source":"Crossref","is-referenced-by-count":1,"title":["Energy Minimization via a Primal-Dual Algorithm for a Convex Program"],"prefix":"10.1007","author":[{"given":"Evripidis","family":"Bampis","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Chau","sequence":"additional","affiliation":[]},{"given":"Dimitrios","family":"Letsios","sequence":"additional","affiliation":[]},{"given":"Giorgio","family":"Lucarelli","sequence":"additional","affiliation":[]},{"given":"Ioannis","family":"Milis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","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. Communications of ACM\u00a053, 86\u201396 (2010)","journal-title":"Communications of ACM"},{"key":"32_CR2","unstructured":"Albers, S.: Algorithms for dynamic speed scaling. In: STACS 2011, pp. 1\u201311 (2011)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-35261-4_14","volume-title":"Algorithms and Computation","author":"E. Bampis","year":"2012","unstructured":"Bampis, E., Letsios, D., Lucarelli, G.: Green scheduling, flows and matchings. In: Chao, K.-M., Hsu, T.-S., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 106\u2013115. Springer, Heidelberg (2012)"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge Un. Press (2004)","DOI":"10.1017\/CBO9780511804441"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Brucker, P.: Scheduling algorithms, 4th edn. Springer (2004)","DOI":"10.1007\/978-3-540-24804-0"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Papadimitriou, C.H., Saberi, A., Vazirani, V.V.: Market equilibrium via a primal-dual algorithm for a convex program. Journal of the ACM\u00a055(5) (2008)","DOI":"10.1145\/1411509.1411512"},{"key":"32_CR7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards, Section B\u00a069, 125\u2013130 (1965)","journal-title":"Journal of Research of the National Bureau of Standards, Section B"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics\u00a08, 399\u2013404 (1956)","journal-title":"Canadian Journal of Mathematics"},{"key":"32_CR9","unstructured":"Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems, ch.\u00a04, pp. 144\u2013191. PWS Publishing Company (1997)"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TC.1979.1675246","volume":"C-28","author":"T. Gonzalez","year":"1979","unstructured":"Gonzalez, T.: A note on open shop preemptive schedules. IEEE Transactions on Computers\u00a0C-28, 782\u2013786 (1979)","journal-title":"IEEE Transactions on Computers"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"32_CR12","unstructured":"Gupta, A., Krishnaswamy, R., Pruhs, K.: Online primal-dual for non-linear optimization with applications to speed scaling. CoRR, abs\/1109.5931 (2011)"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistics Quarterly\u00a02, 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"key":"32_CR14","unstructured":"Vazirani, V.V.: Approximation algorithms, ch. 12. Springer (2001)"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: FOCS 1995, pp. 374\u2013382 (1995)","DOI":"10.1109\/SFCS.1995.492493"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T21:11:06Z","timestamp":1548623466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}