Approximation algorithms for the label-coverMAX and red-blue set cover problems (Extended abstract)

David Peleg

doi:10.1007/3-540-44985-X

Approximation algorithms for the label-cover_MAX and red-blue set cover problems (Extended abstract)

David Peleg

Weizmann Institute of Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

Abstract

This paper presents approximation algorithms for two prob-lpems. First, a randomized algorithm guaranteeing approximation ratio √n with high probability is proposed for the Max-Rep problem of [Kor98], or the Label-CoverMAX problem (cf. [Hoc95]), where n is the number of vertices in the graph. This algorithm is then generalized into a 4 √ n-ratio algorithm for the nonuniform version of the problem. Secondly, it is shown that the Red-Blue Set Cover problem of [CDKM00] can be ap-proximated with ratio 2 √ n log β, where n is the number of sets and n is the number of blue elements. Both algorithms can be adapted to the weighted variants of the respective problems, yielding the same approx-imation ratios.

Original language	English
Title of host publication	Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings
Editors	Magnús M. Halldórsson
Publisher	Springer Verlag
Pages	220-231
Number of pages	12
ISBN (Print)	3540676902, 9783540676904
DOIs	https://doi.org/10.1007/3-540-44985-X
State	Published - 2000
Externally published	Yes
Event	7th Scandinavian Workshop on Algorithm Theory, SWAT 2000 - Bergen, Norway Duration: 5 Jul 2000 → 7 Jul 2000

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1851
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th Scandinavian Workshop on Algorithm Theory, SWAT 2000
Country/Territory	Norway
City	Bergen
Period	5/07/00 → 7/07/00

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.

Access to Document

10.1007/3-540-44985-X

Cite this

Peleg, D. (2000). Approximation algorithms for the label-cover_MAX and red-blue set cover problems (Extended abstract). In M. M. Halldórsson (Ed.), Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings (pp. 220-231). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1851). Springer Verlag. https://doi.org/10.1007/3-540-44985-X

Peleg, David. / Approximation algorithms for the label-cover_MAX and red-blue set cover problems (Extended abstract). Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. editor / Magnús M. Halldórsson. Springer Verlag, 2000. pp. 220-231 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{a281a6ee4a79438193d25d36d1b131af,

title = "Approximation algorithms for the label-coverMAX and red-blue set cover problems (Extended abstract)",

abstract = "This paper presents approximation algorithms for two prob-lpems. First, a randomized algorithm guaranteeing approximation ratio √n with high probability is proposed for the Max-Rep problem of [Kor98], or the Label-CoverMAX problem (cf. [Hoc95]), where n is the number of vertices in the graph. This algorithm is then generalized into a 4 √ n-ratio algorithm for the nonuniform version of the problem. Secondly, it is shown that the Red-Blue Set Cover problem of [CDKM00] can be ap-proximated with ratio 2 √ n log β, where n is the number of sets and n is the number of blue elements. Both algorithms can be adapted to the weighted variants of the respective problems, yielding the same approx-imation ratios.",

author = "David Peleg",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000 ; Conference date: 05-07-2000 Through 07-07-2000",

year = "2000",

doi = "10.1007/3-540-44985-X",

language = "אנגלית",

isbn = "3540676902",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "220--231",

editor = "Halld{\'o}rsson, \{Magn{\'u}s M.\}",

booktitle = "Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings",

address = "גרמניה",

}

Peleg, D 2000, Approximation algorithms for the label-cover_MAX and red-blue set cover problems (Extended abstract). in MM Halldórsson (ed.), Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1851, Springer Verlag, pp. 220-231, 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000, Bergen, Norway, 5/07/00. https://doi.org/10.1007/3-540-44985-X

Approximation algorithms for the label-cover_MAX and red-blue set cover problems (Extended abstract). / Peleg, David.
Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. ed. / Magnús M. Halldórsson. Springer Verlag, 2000. p. 220-231 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1851).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Approximation algorithms for the label-coverMAX and red-blue set cover problems (Extended abstract)

AU - Peleg, David

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2000.

PY - 2000

Y1 - 2000

N2 - This paper presents approximation algorithms for two prob-lpems. First, a randomized algorithm guaranteeing approximation ratio √n with high probability is proposed for the Max-Rep problem of [Kor98], or the Label-CoverMAX problem (cf. [Hoc95]), where n is the number of vertices in the graph. This algorithm is then generalized into a 4 √ n-ratio algorithm for the nonuniform version of the problem. Secondly, it is shown that the Red-Blue Set Cover problem of [CDKM00] can be ap-proximated with ratio 2 √ n log β, where n is the number of sets and n is the number of blue elements. Both algorithms can be adapted to the weighted variants of the respective problems, yielding the same approx-imation ratios.

AB - This paper presents approximation algorithms for two prob-lpems. First, a randomized algorithm guaranteeing approximation ratio √n with high probability is proposed for the Max-Rep problem of [Kor98], or the Label-CoverMAX problem (cf. [Hoc95]), where n is the number of vertices in the graph. This algorithm is then generalized into a 4 √ n-ratio algorithm for the nonuniform version of the problem. Secondly, it is shown that the Red-Blue Set Cover problem of [CDKM00] can be ap-proximated with ratio 2 √ n log β, where n is the number of sets and n is the number of blue elements. Both algorithms can be adapted to the weighted variants of the respective problems, yielding the same approx-imation ratios.

UR - https://www.scopus.com/pages/publications/84956869850

U2 - 10.1007/3-540-44985-X

DO - 10.1007/3-540-44985-X

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84956869850

SN - 3540676902

SN - 9783540676904

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 220

EP - 231

BT - Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings

A2 - Halldórsson, Magnús M.

PB - Springer Verlag

T2 - 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000

Y2 - 5 July 2000 through 7 July 2000

ER -

Peleg D. Approximation algorithms for the label-cover_MAX and red-blue set cover problems (Extended abstract). In Halldórsson MM, editor, Algorithm Theory - SWAT 2000 - 7th Scandinavian Workshop on Algorithm Theory, 2000, Proceedings. Springer Verlag. 2000. p. 220-231. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44985-X