{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:25:48Z","timestamp":1725549948027},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_72","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T12:46:24Z","timestamp":1128602784000},"page":"815-826","source":"Crossref","is-referenced-by-count":2,"title":["Bucket Game with Applications to Set Multicover and Dynamic Page Migration"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaros\u0142aw","family":"Byrka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"72_CR1","unstructured":"Bartal, Y., Charikar, M., Indyk, P.: On page migration and other relaxed task systems. In: Proc. of the 8th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 43\u201352 (1997)"},{"key":"72_CR2","doi-asserted-by":"crossref","unstructured":"Ben-David, S., Borodin, A., Karp, R.M., Tardos, G., Wigderson, A.: On the power of randomization in online algorithms. In: Proc. of the 22nd ACM Symp. on Theory of Computing (STOC), pp. 379\u2013386 (1990)","DOI":"10.1145\/100216.100268"},{"key":"72_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-27821-4_4","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"P. Berman","year":"2004","unstructured":"Berman, P., DasGupta, B., Sontag, E.: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 39\u201350. Springer, Heidelberg (2004)"},{"key":"72_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-540-31856-9_30","volume-title":"STACS 2005","author":"M. Bienkowski","year":"2005","unstructured":"Bienkowski, M., Dynia, M., Korzeniowski, M.: Improved algorithms for dynamic page migration. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 365\u2013376. Springer, Heidelberg (2005)"},{"key":"72_CR5","doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Korzeniowski, auf der Heide, F.M.: Fighting against two adversaries: Page migration in dynamic networks. In: Proc. of the 16th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 64\u201373 (2004)","DOI":"10.1145\/1007912.1007923"},{"key":"72_CR6","unstructured":"Black, D.L., Sleator, D.D.: Competitive algorithms for replication and migration problems. Technical Report CMU-CS-89-201, Department of Computer Science, Carnegie-Mellon University (1989)"},{"key":"72_CR7","doi-asserted-by":"crossref","unstructured":"Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. In: Proc. of the 9th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 228\u2013248 (1998)","DOI":"10.1006\/jagm.1998.0993"},{"key":"72_CR8","doi-asserted-by":"crossref","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. In: Proc. of the 5th ACM Symp. on Theory of Computing (STOC), pp. 38\u201349 (1973)","DOI":"10.1145\/800125.804034"},{"key":"72_CR9","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of the optimal integral and fractional covers. Discrete Mathematics\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Mathematics"},{"key":"72_CR10","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Approximation Algorithms for Combinatorial Optimization Problems, pp. 229\u2013242 (2002)","DOI":"10.1007\/3-540-45753-4_20"},{"issue":"2","key":"72_CR11","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1137\/S0097539793260763","volume":"28","author":"S. Rajagopalan","year":"1999","unstructured":"Rajagopalan, S., Vazirani, V.V.: Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM Journal on Computing\u00a028(2), 525\u2013540 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"72_CR12","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proc. of the 29th ACM Symp. on Theory of Computing (STOC), pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"issue":"2","key":"72_CR13","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"},{"key":"72_CR14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1090\/dimacs\/007\/10","volume":"7","author":"J. Westbrook","year":"1992","unstructured":"Westbrook, J.: Randomized algorithms for multiprocessor page migration. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a07, 135\u2013150 (1992)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:50:51Z","timestamp":1605642651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11561071_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}