### Abstract

Original language | Undefined |
---|---|

Place of Publication | Enschede |

Publisher | Universiteit Twente |

Number of pages | 10 |

ISBN (Print) | 0169-2690 |

Publication status | Published - 1996 |

### Publication series

Name | Memorandum / Faculty of Applied Mathematics |
---|---|

Publisher | University of Twente, Department of Applied Mathematics |

No. | 1330 |

### Keywords

- METIS-141171
- IR-30531

### Cite this

*Packing a bin online to maximize the total number of items*. (Memorandum / Faculty of Applied Mathematics; No. 1330). Enschede: Universiteit Twente.

}

*Packing a bin online to maximize the total number of items*. Memorandum / Faculty of Applied Mathematics, no. 1330, Universiteit Twente, Enschede.

**Packing a bin online to maximize the total number of items.** / Faigle, U.; Kern, Walter.

Research output: Book/Report › Report › Professional

TY - BOOK

T1 - Packing a bin online to maximize the total number of items

AU - Faigle, U.

AU - Kern, Walter

N1 - Memorandum fac. TW

PY - 1996

Y1 - 1996

N2 - A bin of capacity 1 and a nite sequence of items of sizes a1; a2; : : : are considered, where the items are given one by one without information about the future. An online algorithm A must irrevocably decide whether or not to put an item into the bin whenever it is presented. The goal is to maximize the number of items collected. A is f-competitive for some function f if n() f(nA()) holds for all sequences , where n is the (theoretical) optimum and nA the number of items collected by A. A necessary condition on f for the existence of an f-competitive (possibly randomized) online algorithm is given. On the other hand, this condition is seen to guarantee the existence of a deterministic online algorithm that is "almost" f-competitive in a well-dened sense.

AB - A bin of capacity 1 and a nite sequence of items of sizes a1; a2; : : : are considered, where the items are given one by one without information about the future. An online algorithm A must irrevocably decide whether or not to put an item into the bin whenever it is presented. The goal is to maximize the number of items collected. A is f-competitive for some function f if n() f(nA()) holds for all sequences , where n is the (theoretical) optimum and nA the number of items collected by A. A necessary condition on f for the existence of an f-competitive (possibly randomized) online algorithm is given. On the other hand, this condition is seen to guarantee the existence of a deterministic online algorithm that is "almost" f-competitive in a well-dened sense.

KW - METIS-141171

KW - IR-30531

M3 - Report

SN - 0169-2690

T3 - Memorandum / Faculty of Applied Mathematics

BT - Packing a bin online to maximize the total number of items

PB - Universiteit Twente

CY - Enschede

ER -