Abstract
In this paper we study the Revocable Online Knapsack Problem (ROKP) which is an extension of the Online Knapsack Problem [8]. We prove an optimal upper bound of 1/t for the competitive ratio of ROKP, where t is a real root of 4x 3 + 5x 2 – x – 4 = 0 (t ≈0.76850 and 1/t ≈1.3012). To prove this result, we made a full use of computer programs as follows: For the base algorithm that is designed in a conventional manner, we first construct an equivalent finite state diagram with about 300 states. Then for each state, we generate a finite set of inequalities such that the competitive ratio at that state is at most 1/t if the set of inequalities do not have a real solution. The latter can be checked by Mathematica. The number of inequalities generated was approximately 600 in total, and our computation time was 30 minutes using Athlon XP 2600+.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Appel, K., Haken, W.: Every planar map is four colorable. Part 1, II. Dischargin. Illinois Journal of Mathematics 21, 429–597 (1977)
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. 1770, pp. 605–613. Springer, Heidelberg (2000)
Bein, W.W., Chrobak, M., Larmore, L.L.: The 3-server problem in the plane. Theoretical Computer Science 289(1), 335–354 (2002)
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–189 (1995)
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115–1145 (1995)
Grove, E.F.: Online bin packing with lookahead. In: Proc. SODA, pp. 430–436 (1995)
Ivkovic, Z., Lloyd, E.L.: Fully dynamic algorithms for bin packing: Being (Mostly) myopic helps. In: Proc. ESA. LNCS, pp. 224–235. Springer, Heidelberg (1993)
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. 2380, pp. 293–305. Springer, Heidelberg (2002)
Karloff, H., Zwick, U.: A 7/8-approximation algorithm for MAX 3SAT? In: Proc. FOCS, pp. 406–415 (1997)
Kullmann, O.: New methods for 3-SAT decision and worst-case analysis. Theoretical Computer Science 223(1-2), 1–72 (1999)
Lee, C.C., Lee, D.T.: A simple on-line bin-packing algorithm. J. ACM 32(3), 562–572 (1985)
Manasse, M., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for server problems. J. Algorithms 11, 208–230 (1990)
Richey, M.B.: Improved bounds for harmonic-based bin packing algorithms. Discr. Appli. Math. 34, 203–227 (1991)
Seiden, S.S.: On the online bin packing problem. J. ACM 49(5), 640–671 (2002)
Trevisan, L., Sorkin, G.B., Sudan, M., Williamson, D.P.: Gadgets, Approximation, and Linear Programming. SIAM J. Comput. 29(6), 2074–2097 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Horiyama, T., Iwama, K., Kawahara, J. (2006). Finite-State Online Algorithms and Their Automated Competitive Analysis. In: Asano, T. (eds) Algorithms and Computation. ISAAC 2006. Lecture Notes in Computer Science, vol 4288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11940128_9
Download citation
DOI: https://doi.org/10.1007/11940128_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49694-6
Online ISBN: 978-3-540-49696-0
eBook Packages: Computer ScienceComputer Science (R0)