Online primal-dual algorithms for covering and packing problems

Niv Buchbinder*, Joseph Naor

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


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.

Original languageEnglish
Pages (from-to)689-701
Number of pages13
JournalLecture Notes in Computer Science
StatePublished - 2005
Externally publishedYes
Event13th Annual European Symposium on Algorithms, ESA 2005 - Palma de Mallorca, Spain
Duration: 3 Oct 20056 Oct 2005


Dive into the research topics of 'Online primal-dual algorithms for covering and packing problems'. Together they form a unique fingerprint.

Cite this