{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T01:47:41Z","timestamp":1772848061943,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,4,27]],"date-time":"2014-04-27T00:00:00Z","timestamp":1398556800000},"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":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10100-014-0349-4","type":"journal-article","created":{"date-parts":[[2014,4,26]],"date-time":"2014-04-26T01:44:22Z","timestamp":1398476662000},"page":"699-722","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A fast approximate implementation of the work function algorithm for solving the $$k$$ k -server problem"],"prefix":"10.1007","volume":"23","author":[{"given":"Tomislav","family":"Rudec","sequence":"first","affiliation":[]},{"given":"Robert","family":"Manger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,27]]},"reference":[{"key":"349_CR1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.tcs.2004.06.001","volume":"324","author":"Y Bartal","year":"2004","unstructured":"Bartal Y, Koutsoupias E (2004) On the competitive ratio of the work function algorithm for the $$k$$ k -server problem. Theor Comput Sci 324:337\u2013345","journal-title":"Theor Comput Sci"},{"key":"349_CR2","volume-title":"Linear programming and network flows","author":"MS Bazaraa","year":"2004","unstructured":"Bazaraa MS, Jarvis JJ, Sherali HD (2004) Linear programming and network flows, 3rd edn. Wiley-Interscience, New York","edition":"3"},{"key":"349_CR3","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"2005","unstructured":"Borodin A, El-Yaniv R (2005) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"key":"349_CR4","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/0404017","volume":"4","author":"M Chrobak","year":"1991","unstructured":"Chrobak M, Karloff H, Payne TH, Vishwanathan S (1991) New results on server problems. SIAM J Discret Math 4:172\u2013181","journal-title":"SIAM J Discret Math"},{"key":"349_CR5","doi-asserted-by":"crossref","first-page":"2642","DOI":"10.1016\/j.tcs.2010.08.007","volume":"412","author":"Y Emek","year":"2011","unstructured":"Emek Y, Fraigniaud P, Korman A, Rosen A (2011) Online computation with advice. Theor Comput Sci 412:2642\u20132656","journal-title":"Theor Comput Sci"},{"key":"349_CR6","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1016\/j.ipl.2010.09.003","volume":"110","author":"Y Emek","year":"2010","unstructured":"Emek Y, Fraigniaud P, Korman A, Rosen A (2010) On the additive constant of the $$k$$ k -server work function algorithm. Inf Proces Lett 110:1120\u20131123","journal-title":"Inf Proces Lett"},{"key":"349_CR7","doi-asserted-by":"crossref","unstructured":"Flammini M, Nicosia G (2010) On the bicriteria $$k$$ k -server problem. ACM Trans Algorithms 7. Article no 6, 19 p","DOI":"10.1145\/1868237.1868244"},{"key":"349_CR8","first-page":"521","volume-title":"Approximation algorithms for NP-hard problems","author":"S Irani","year":"1997","unstructured":"Irani S, Karlin AR (1997) Online computation. In: Hochbaum D (ed) Approximation algorithms for NP-hard problems. PWS Publishing, Boston, pp 521\u2013564"},{"key":"349_CR9","unstructured":"Jungnickel D (2005) Graphs, networks and algorithms, 2nd edn. Springer, Berlin"},{"key":"349_CR10","doi-asserted-by":"crossref","unstructured":"Koutsoupias E, Papadimitrou C (1994) On the $$k$$ k -server conjecture. In: Leighton FT, Goodrich M (eds) Proceedings of the 26-th annual ACM symposium on theory of computing, Montreal, QC, Canada, May 23\u201325, 1994. ACM Press, New York, pp 507\u2013511","DOI":"10.1145\/195058.195245"},{"key":"349_CR11","doi-asserted-by":"crossref","unstructured":"Koutsoupias E (1999) Weak adversaries for the $$k$$ k -server problem. In: Beame P (ed) Proceedings of the 40th annual symposium on foundations of computer science, New York, USA, October 17\u201318, 1999. IEEE, New York, pp 444\u2013449","DOI":"10.1109\/SFFCS.1999.814616"},{"key":"349_CR12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.cosrev.2009.04.002","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias E (2009) The $$k$$ k -server problem. Comput Sci Rev 3:105\u2013118","journal-title":"Comput Sci Rev"},{"key":"349_CR13","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M Manasse","year":"1990","unstructured":"Manasse M, McGeoch LA, Sleator D (1990) Competitive algorithms for server problems. J Algorithms 11:208\u2013230","journal-title":"J Algorithms"},{"key":"349_CR14","doi-asserted-by":"crossref","first-page":"361","DOI":"10.2498\/cit.1001922","volume":"18","author":"T Rudec","year":"2010","unstructured":"Rudec T, Baumgartner A, Manger R (2010) Measuring true performance of the work function algorithm for solving the on-line $$k$$ k -server problem. J Comput Inf Technol CIT 18:361\u2013367","journal-title":"J Comput Inf Technol CIT"},{"key":"349_CR15","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10100-011-0222-7","volume":"21","author":"T Rudec","year":"2013","unstructured":"Rudec T, Baumgartner A, Manger R (2013) A fast work function algorithm for solving the $$k$$ k -server problem. Central Eur J Oper Res CEJOR 21:187\u2013205","journal-title":"Central Eur J Oper Res CEJOR"},{"key":"349_CR16","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1016\/j.cor.2012.11.006","volume":"40","author":"T Rudec","year":"2013","unstructured":"Rudec T, Manger R (2013) A new approach to solve the $$k$$ k -server problem based on network flows and flow cost reduction. Comput Oper Res 40:1004\u20131013","journal-title":"Comput Oper Res"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0349-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-014-0349-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0349-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T18:32:25Z","timestamp":1565375545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-014-0349-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,27]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["349"],"URL":"https:\/\/doi.org\/10.1007\/s10100-014-0349-4","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,27]]}}}