We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints that define the feasible solution space are given one by one in an online fashion. In an online packing problem the profit function as well as the exact packing constraints are not fully known in advance. In each round additional information about the profit function and the constraints is revealed. We provide general deterministic schemes for online fractional covering and packing problems. We also provide deterministic algorithms for a couple of integral covering and packing problems.
|Number of pages||13|
|Journal||Lecture Notes in Computer Science|
|State||Published - 2005|
|Event||13th Annual European Symposium on Algorithms, ESA 2005 - Palma de Mallorca, Spain|
Duration: 3 Oct 2005 → 6 Oct 2005