{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:29Z","timestamp":1725474989272},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_9","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T05:57:35Z","timestamp":1164779855000},"page":"71-80","source":"Crossref","is-referenced-by-count":5,"title":["Finite-State Online Algorithms and Their Automated Competitive Analysis"],"prefix":"10.1007","author":[{"given":"Takashi","family":"Horiyama","sequence":"first","affiliation":[]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Kawahara","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","volume":"21","author":"K. Appel","year":"1977","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable. Part 1, II. Dischargin. Illinois Journal of Mathematics\u00a021, 429\u2013597 (1977)","journal-title":"Illinois Journal of Mathematics"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/3-540-46541-3_50","volume-title":"STACS 2000","author":"Y. Bartal","year":"2000","unstructured":"Bartal, Y., Koutsoupias, E.: On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 605\u2013613. Springer, Heidelberg (2000)"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0304-3975(01)00305-X","volume":"289","author":"W.W. Bein","year":"2002","unstructured":"Bein, W.W., Chrobak, M., Larmore, L.L.: The 3-server problem in the plane. Theoretical Computer Science\u00a0289(1), 335\u2013354 (2002)","journal-title":"Theoretical Computer Science"},{"key":"9_CR4","unstructured":"Feige, U., Goemans, M.X.: Approximating the value of two prover proof systems, with applications to MAX-2SAT and MAX-DICUT. In: Proc. ISTCS, pp.182\u2013189 (1995)"},{"issue":"6","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM\u00a042(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"9_CR6","unstructured":"Grove, E.F.: Online bin packing with lookahead. In: Proc. SODA, pp. 430\u2013436 (1995)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/3-540-57273-2_58","volume-title":"Proc. ESA","author":"Z. Ivkovic","year":"1993","unstructured":"Ivkovic, Z., Lloyd, E.L.: Fully dynamic algorithms for bin packing: Being (Mostly) myopic helps. In: Proc. ESA. LNCS, pp. 224\u2013235. Springer, Heidelberg (1993)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-45465-9_26","volume-title":"Automata, Languages and Programming","author":"K. Iwama","year":"2002","unstructured":"Iwama, K., Taketomi, S.: Removable on-line knapsack problems. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 293\u2013305. Springer, Heidelberg (2002)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Karloff, H., Zwick, U.: A 7\/8-approximation algorithm for MAX 3SAT? In: Proc. FOCS, pp. 406\u2013415 (1997)","DOI":"10.1109\/SFCS.1997.646129"},{"issue":"1-2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(98)00017-6","volume":"223","author":"O. Kullmann","year":"1999","unstructured":"Kullmann, O.: New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science\u00a0223(1-2), 1\u201372 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C.C. Lee","year":"1985","unstructured":"Lee, C.C., Lee, D.T.: A simple on-line bin-packing algorithm. J. ACM\u00a032(3), 562\u2013572 (1985)","journal-title":"J. ACM"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M. Manasse","year":"1990","unstructured":"Manasse, M., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for server problems. J. Algorithms\u00a011, 208\u2013230 (1990)","journal-title":"J. Algorithms"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0166-218X(91)90087-D","volume":"34","author":"M.B. Richey","year":"1991","unstructured":"Richey, M.B.: Improved bounds for harmonic-based bin packing algorithms. Discr. Appli. Math.\u00a034, 203\u2013227 (1991)","journal-title":"Discr. Appli. Math."},{"issue":"5","key":"9_CR14","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"S.S. Seiden","year":"2002","unstructured":"Seiden, S.S.: On the online bin packing problem. J. ACM\u00a049(5), 640\u2013671 (2002)","journal-title":"J. ACM"},{"issue":"6","key":"9_CR15","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1137\/S0097539797328847","volume":"29","author":"L. Trevisan","year":"2000","unstructured":"Trevisan, L., Sorkin, G.B., Sudan, M., Williamson, D.P.: Gadgets, Approximation, and Linear Programming. SIAM J. Comput.\u00a029(6), 2074\u20132097 (2000)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:50:13Z","timestamp":1619509813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11940128_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}
