{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:07Z","timestamp":1725489787654},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73951-7_30","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T10:18:03Z","timestamp":1187605083000},"page":"337-348","source":"Crossref","is-referenced-by-count":0,"title":["The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaros\u0142aw","family":"Kuty\u0142owski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Bollob\u00e1s, B., Mendel, M.: A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems. In: FOCS 2001. Proc. of the 42nd IEEE Symp. on Foundations of Computer Science, pp. 396\u2013405 (2001)","DOI":"10.1109\/SFCS.2001.959914"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Linial, N., Mendel, M., Naor, A.: On metric Ramsey-type phenomena. In: Proc. of the 35th ACM Symp. on Theory of Computing (STOC), pp. 463\u2013472 (2003)","DOI":"10.1145\/780542.780610"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.jalgor.2004.06.002","volume":"55","author":"Y. Bartal","year":"2005","unstructured":"Bartal, Y., Mendel, M.: Randomized k-server algorithms for growth-rate bounded graphs. Journal of Algorithms\u00a055(2), 192\u2013202 (2005)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1002\/rsa.20124","volume":"29","author":"B. Csaba","year":"2006","unstructured":"Csaba, B., Lodha, S.: A randomized on-line algorithm for the k-server problem on a line. Random Structures and Algorithms\u00a029(1), 82\u2013104 (2006)","journal-title":"Random Structures and Algorithms"},{"issue":"4","key":"30_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/0196-6774(91)90041-V","volume":"12","author":"A. Fiat","year":"1991","unstructured":"Fiat, A., Karp, R.M., Luby, M., McGeoch, L.A., Sleator, D.D., Young, N.E.: Competitive paging algorithms. Journal of Algorithms\u00a012(4), 685\u2013699 (1991)","journal-title":"Journal of Algorithms"},{"issue":"5","key":"30_CR6","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1145\/210118.210128","volume":"42","author":"E. Koutsoupias","year":"1995","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: On the k-server conjecture. Journal of the ACM\u00a042(5), 971\u2013983 (1995), Also appeared in Proc. of the 26th STOC, pp. 507\u2013511 (1994)","journal-title":"Journal of the ACM"},{"issue":"2","key":"30_CR7","first-page":"208","volume":"11","author":"M.S. Manasse","year":"1990","unstructured":"Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for server problems. Journal of the ACM\u00a011(2), 208\u2013230 (1990), Also appeared as Competitive algorithms for on-line problems. In: Proc. of the 20th STOC, pp. 322\u2013333 (1988)","journal-title":"Journal of the ACM"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-44676-1_7","volume-title":"Algorithms - ESA 2001","author":"S.S. Seiden","year":"2001","unstructured":"Seiden, S.S.: A general decomposition theorem for the k-server problem. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 86\u201397. Springer, Heidelberg (2001)"},{"issue":"2","key":"30_CR9","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"},{"issue":"3","key":"30_CR10","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s00453-001-0124-5","volume":"33","author":"N.E. Young","year":"2002","unstructured":"Young, N.E.: On-line file caching. Algorithmica\u00a033(3), 371\u2013383 (2002), Also appeared in Proc.\u00a0of the 9th SODA, pp. 82\u201386 (1998)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:05:55Z","timestamp":1619517955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540739487","9783540739517"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}