## 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 | |

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.

## Fingerprint

Dive into the research topics of 'Approximation algorithms for the label-cover_{MAX}and red-blue set cover problems (Extended abstract)'. Together they form a unique fingerprint.