Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems

David Peleg

Research output: Contribution to journalArticlepeer-review

48 Scopus citations

Abstract

This paper presents approximation algorithms for two extensions of the set cover problem: a graph-based extension known as the Max-Rep or Label-CoverMAXproblem, and a color-based extension known as the Red-Blue Set Cover problem. First, a randomized algorithm guaranteeing approximation ratio sqrt(n) with high probability is proposed for the Max-Rep (or Label-CoverMAX) problem, where n is the number of vertices in the graph. This algorithm is then generalized into a 4 sqrt(n)-ratio algorithm for the nonuniform version of the problem. Secondly, it is shown that the Red-Blue Set Cover problem can be approximated with ratio 2 sqrt(n log β), where n is the number of sets and β is the number of blue elements. Both algorithms can be adapted to the weighted variants of the respective problems, yielding the same approximation ratios.

Original languageEnglish
Pages (from-to)55-64
Number of pages10
JournalJournal of Discrete Algorithms
Volume5
Issue number1
DOIs
StatePublished - Mar 2007
Externally publishedYes

Keywords

  • Approximation algorithms
  • Label Cover
  • Max-Rep problem
  • Red-Blue Set Cover

Fingerprint

Dive into the research topics of 'Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems'. Together they form a unique fingerprint.

Cite this