{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:30:29Z","timestamp":1740547829321,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_43","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:01:54Z","timestamp":1283972514000},"page":"489-500","source":"Crossref","is-referenced-by-count":1,"title":["Topology Matters: Smoothed Competitiveness of Metrical Task Systems"],"prefix":"10.1007","author":[{"given":"Guido","family":"Sch\u00e4fer","sequence":"first","affiliation":[]},{"given":"Naveen","family":"Sivadasan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Sch\u00e4fer, G., Vredeveld, T.: Average case and smoothed competitive analysis of the multi-level feedback algorithm. In: Proceedings of the Forty-Fourth Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 462\u2013471 (2003)","DOI":"10.1109\/SFCS.2003.1238219"},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1145\/146585.146588","volume":"39","author":"A. Borodin","year":"1992","unstructured":"Borodin, A., Linial, N., Saks, M.: An optimal online algorithm for metrical task systems. Journal of the ACM\u00a039, 745\u2013763 (1992)","journal-title":"Journal of the ACM"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for on-line problems. In: ACM Symposium on Theory of Computing, pp. 322\u2013333 (1988)","DOI":"10.1145\/62212.62243"},{"key":"43_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized algorithms, 1st edn. Cambridge University Press, Cambridge (1995)","edition":"1"},{"key":"43_CR6","unstructured":"Sch\u00e4fer, G., Sivadasan, N.: Topology matters: Smoothed competitiveness of metrical task systems. Technical Report MPI-I-2003-1-016, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (2003)"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Spielman, D., Teng, S.H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. In: ACM Symposium on Theory of Computing (2001)","DOI":"10.1145\/380752.380813"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T17:08:21Z","timestamp":1740503301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}