Removable online knapsack problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 293-305

  Iwama, Kazuo ^a   Taketomi, Shiro ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

COMPETITIVE RATIO; KNAPSACK PROBLEMS; ONLINE MODELING; TIGHT BOUND;

COMBINATORIAL OPTIMIZATION;

EID: 84869161664     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_26     Document Type: Conference Paper

References (10)

1. J. Csirik, G. Galambos, and G. Turán, "A lower bound on on-line algorithms for decreasing lists," Proc. EURO VI, 1984.
2. J. Csirik, and G. Woeginger, "Resource argumentation for online bounded space bin packing," Proc. ICALP 2000, pp. 296-304, 2000.
3. M. M. Halldórsson, "Online coloring known graphs," Electronic J. Combinatorics, Vol.7, R7, 2000. www.combinatorics.org.
4. M. M. Halldórsson, K. Iwama, S. Miyazaki, and S. Taketomi, "Online independent sets," Proc. COCOON 2000, pp. 202-209, 2000.
5. D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham, "Worstcase performance bounds for simple one-dimensional packing algorithms," SIAM Journal on Computing, Vol. 3(4), pp. 299-325, 1974.
6. G. S. Lueker, "Average-case analysis of off-line and on-line knapsack problems," Proc. Sixth Annual ACM-SIAM SODA, pp. 179-188, 1995.
7. A. Marchetti-Spaccamela and C. Vercellis, "Stochastic on-line knapsack problems," Math. Programming, Vol. 68(1, Ser. A), pp. 73-104, 1995.
8. S. S. Seiden, "On the online bin packing problem," Proc. ICALP 2001, pp. 237-248, 2001.
9. S. S. Seiden, "An optimal online algorithm for bounded space variable-sized bin packing," Proc. ICALP 2000, pp. 283-295, 2000.
10. A. van Vliet, "On the asymptotic worst case behavior of harmonic fit," J. Algorithms, Vol. 20, pp. 113-136, 1996.