{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:19:11Z","timestamp":1757312351545},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,7,16]],"date-time":"2015-07-16T00:00:00Z","timestamp":1437004800000},"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":["Math. Program."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10107-015-0930-1","type":"journal-article","created":{"date-parts":[[2015,7,15]],"date-time":"2015-07-15T12:37:00Z","timestamp":1436963820000},"page":"493-514","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Coupled and k-sided placements: generalizing generalized assignment"],"prefix":"10.1007","volume":"154","author":[{"given":"Madhukar","family":"Korupolu","sequence":"first","affiliation":[]},{"given":"Adam","family":"Meyerson","sequence":"additional","affiliation":[]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[]},{"given":"Brian","family":"Tagiku","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"key":"930_CR1","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1145\/502912.502915","volume":"19","author":"GA 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. Trans. Comput. Syst. 19, 483\u2013518 (2001)","journal-title":"Trans. Comput. Syst."},{"key":"930_CR2","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":"930_CR3","doi-asserted-by":"crossref","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 Trans. Comput. Syst. 23, 337\u2013374 (2005)","journal-title":"ACM Trans. Comput. Syst."},{"key":"930_CR4","doi-asserted-by":"crossref","unstructured":"Appleby, K., Fakhouri, S., Fong, L., Goldszmidt, G., Kalantar, M., Krishnakumar, S., Pazel, D.P., 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":"930_CR5","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"},{"key":"930_CR6","doi-asserted-by":"crossref","unstructured":"Azar, Y., Epstein, A.: Convex programming for scheduling unrelated parallel machines. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing STOC\u201905, pp. 331\u2013337 (2005)","DOI":"10.1145\/1060590.1060639"},{"key":"930_CR7","unstructured":"Bansal, N.: Personal communication (2014)"},{"key":"930_CR8","doi-asserted-by":"crossref","unstructured":"Bansal, N., Korula, N., Nagarajan, V., Srinivasan, A.: On $$k$$ 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"},{"key":"930_CR9","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J.: Improved bounds for online routing and packing via a primal-dual approach. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21\u201324 October 2006, Berkeley, California, USA, Proceedings, pp. 293\u2013304 (2006)","DOI":"10.1109\/FOCS.2006.39"},{"issue":"2\u20133","key":"930_CR10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1561\/0400000024","volume":"3","author":"N Buchbinder","year":"2009","unstructured":"Buchbinder, N., Naor, J.: The design of competitive online algorithms via a primal-dual approach. Found. Trends Theor. Comput. Sci. 3(2\u20133), 93\u2013263 (2009)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"930_CR11","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\/502034.502045"},{"key":"930_CR12","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":"930_CR13","doi-asserted-by":"crossref","unstructured":"Cygan, M., Grandoni, F., Mastrolilli, M.: How to sell hyperedges: the hypermatching assignment problem. In: Symposium on Discrete Algorithms (SODA), pp. 342\u2013351 (2013)","DOI":"10.1137\/1.9781611973105.25"},{"key":"930_CR14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/356876.356883","volume":"14","author":"LW Dowdy","year":"1982","unstructured":"Dowdy, L.W., Foster, D.V.: Comparative models of the file assignment problem. ACM Surv. 14, 287\u2013313 (1982)","journal-title":"ACM Surv."},{"key":"930_CR15","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: Symposium on Discrete Algorithms (SODA), pp. 611\u2013620 (2006)","DOI":"10.1145\/1109557.1109624"},{"key":"930_CR16","doi-asserted-by":"crossref","unstructured":"Harris, D., Srinivasan, A.: The Moser-Tardos framework with partial resampling, (2014, preprint). arXiv:1406.5943","DOI":"10.1109\/FOCS.2013.57"},{"key":"930_CR17","doi-asserted-by":"crossref","unstructured":"Harris, D.G., Srinivasan, A.: Constraint satisfaction, packet routing, and the Lov\u00e1sz Local Lemma. In: Symposium on Theory of Computing Conference, STOC\u201913, Palo Alto, CA, USA, 1\u20134 June 2013, pp. 685\u2013694 (2013)","DOI":"10.1145\/2488608.2488696"},{"key":"930_CR18","doi-asserted-by":"crossref","unstructured":"Harris, D.G., Srinivasan, A.: The moser-tardos framework with partial resampling. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 469\u2013478 (2013)","DOI":"10.1109\/FOCS.2013.57"},{"issue":"1","key":"930_CR19","doi-asserted-by":"crossref","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. Comput. Complex. 15(1), 20\u201339 (2006)","journal-title":"Comput. Complex."},{"key":"930_CR20","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":"930_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511977152","volume-title":"Iterative Methods in Combinatorial Optimization. Cambridge Texts in Applied Mathematics","author":"LC Lau","year":"2011","unstructured":"Lau, L.C., Ravi, R., Singh, M.: Iterative Methods in Combinatorial Optimization. Cambridge Texts in Applied Mathematics. Cambridge University Press, Cambridge (2011)"},{"issue":"3","key":"930_CR22","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46(3), 259\u2013271 (1990)","journal-title":"Math. Program."},{"key":"930_CR23","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/1327452.1327491","volume":"51","author":"DA Patterson","year":"2008","unstructured":"Patterson, D.A.: Technical perspective: the data center is the computer. Commun. ACM 51, 105\u2013105 (2008)","journal-title":"Commun. ACM"},{"issue":"3","key":"930_CR24","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"DB Shmoys","year":"1993","unstructured":"Shmoys, D.B., Tardos, \u00c9.: An approximation algorithm for the generalized assignment problem. Math. Program. 62(3), 461\u2013474 (1993)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0930-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0930-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0930-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T07:53:18Z","timestamp":1566978798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0930-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,16]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["930"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0930-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,16]]}}}