{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T04:13:07Z","timestamp":1746245587565,"version":"3.40.4"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075563"},{"type":"electronic","value":"9783319075570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07557-0_30","type":"book-chapter","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T11:50:30Z","timestamp":1400327430000},"page":"357-368","source":"Crossref","is-referenced-by-count":0,"title":["Coupled and k-Sided Placements: Generalizing Generalized Assignment"],"prefix":"10.1007","author":[{"given":"Madhukar","family":"Korupolu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Meyerson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Tagiku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1145\/1327452.1327491","volume":"51","author":"D.A. Patterson","year":"2008","unstructured":"Patterson, D.A.: Technical perspective: the data center is the computer. Communications of the ACM\u00a051, 105\u2013105 (2008)","journal-title":"Communications of the ACM"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Dowdy, L.W., Foster, D.V.: Comparative models of the file assignment problem. ACM Surveys\u00a014 (1982)","DOI":"10.1145\/356876.356883"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1145\/1113574.1113575","volume":"23","author":"E. Anderson","year":"2005","unstructured":"Anderson, E., Kallahalla, M., Spence, S., Swaminathan, R., Wang, Q.: Quickly finding near-optimal storage designs. ACM Transactions on Computer Systems\u00a023, 337\u2013374 (2005)","journal-title":"ACM Transactions on Computer Systems"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Appleby, K., Fakhouri, S., Fong, L., Goldszmidt, G., Kalantar, M., Krishnakumar, S., Pazel, D., Pershing, J., Rochwerger, B.: Oceano-SLA based management of a computing utility. In: Proceedings of the International Symposium on Integrated Network Management, pp. 855\u2013868 (2001)","DOI":"10.1109\/INM.2001.918085"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Chase, J.S., Anderson, D.C., Thakar, P.N., Vahdat, A.M., Doyle, R.P.: Managing energy and server resources in hosting centers. In: Proceedings of the Symposium on Operating Systems Principles, pp. 103\u2013116 (2001)","DOI":"10.1145\/502059.502045"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Korupolu, M., Singh, A., Bamba, B.: Coupled placement in modern data centers. In: Proceedings of the International Parallel and Distributed Processing Symposium, pp. 1\u201312 (2009)","DOI":"10.1109\/IPDPS.2009.5161067"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Bansal, N., Korula, N., Nagarajan, V., Srinivasan, A.: On k-column sparse packing programs. In: Proceedings of the Conference on Integer Programming and Combinatorial Optimization, pp. 369\u2013382 (2010)","DOI":"10.1007\/978-3-642-13036-6_28"},{"issue":"1","key":"30_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E. Hazan","year":"2006","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Computational Complexity\u00a015(1), 20\u201339 (2006)","journal-title":"Computational Complexity"},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D.B. Shmoys","year":"1993","unstructured":"Shmoys, D.B.: \u00c9va Tardos: An approximation algorithm for the generalized assignment problem. Mathematical Programming\u00a062(3), 461\u2013474 (1993)","journal-title":"Mathematical Programming"},{"issue":"3","key":"30_CR10","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B.: \u00c9va Tardos: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming\u00a046(3), 259\u2013271 (1990)","journal-title":"Mathematical Programming"},{"key":"30_CR11","unstructured":"Chekuri, C., Khanna, S.: A PTAS for the multiple knapsack problem. In: Proceedings of the Symposium on Discrete Algorithms, pp. 213\u2013222 (2000)"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: SODA, pp. 611\u2013620 (2006)","DOI":"10.1145\/1109557.1109624"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1145\/502912.502915","volume":"19","author":"G.A. Alvarez","year":"2001","unstructured":"Alvarez, G.A., Borowsky, E., Go, S., Romer, T.H., Becker-Szendy, R., Golding, R., Merchant, A., Spasojevic, M., Veitch, A., Wilkes, J.: Minerva: An automated resource provisioning tool for large-scale storage systems. Transactions on Computer Systems\u00a019, 483\u2013518 (2001)","journal-title":"Transactions on Computer Systems"},{"key":"30_CR14","unstructured":"Anderson, E., Hobbs, M., Keeton, K., Spence, S., Uysal, M., Veitch, A.: Hippodrome: Running circles around storage administration. In: Proceedings of the Conference on File and Storage Technologies, pp. 175\u2013188 (2002)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Cygan, M., Grandoni, F., Mastrolilli, M.: How to sell hyperedges: The hypermatching assignment problem. In: SODA, pp. 342\u2013351 (2013)","DOI":"10.1137\/1.9781611973105.25"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Lau, L., Ravi, R., Singh, M.: Iterative Methods in Combinatorial Optimization. Cambridge Texts in Applied Mathematics. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511977152"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive on-line routing. In: Proceedings of the Symposium on Foundations of Computer Science, pp. 32\u201340 (1993)","DOI":"10.1109\/SFCS.1993.366884"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07557-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T23:25:31Z","timestamp":1746228331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07557-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075563","9783319075570"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07557-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}