Worst-case analysis of the greedy algorithm for a generalization of the maximum p-facility location problem

  • Authors:

  • M. I. Sviridenko

  • Affiliations:

  • Sobolev Institute of Mathematics, Novosibirsk, Russia and Basic Research Institute in Computer Science, University of Aarhus, Denmark

  • Venue:
  • Operations Research Letters
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this work we consider the maximum p-facility location problem with k additional resource constraints. We prove that, the simple greedy algorithm has performance guarantee (1-e^-^(^k^+^1^))/(k+1). In the case k=0 our performance guarantee coincides with bound due to [4].