Online Primal-Dual Algorithms for Covering and Packing Problems

  • Niv Buchbinder
  • Joseph Naor
Conference paper

DOI: 10.1007/11561071_61

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3669)
Cite this paper as:
Buchbinder N., Naor J. (2005) Online Primal-Dual Algorithms for Covering and Packing Problems. In: Brodal G.S., Leonardi S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Niv Buchbinder
    • 1
  • Joseph Naor
    • 1
  1. 1.Computer Science DepartmentTechnionHaifaIsrael

Personalised recommendations