On the differential approximation of MIN SET COVER

Authors:
Cristina Bazgan;Jérôme Monnot;Vangelis Th. Paschos;Fabrice Serrière
Affiliations:
LAMSADE, Université de Paris-Dauphine, Paris Cedex, France;LAMSADE, Université de Paris-Dauphine, Paris Cedex, France;LAMSADE, Université de Paris-Dauphine, Paris Cedex, France;LAMSADE, Université de Paris-Dauphine, Paris Cedex, France
Venue:
Theoretical Computer Science
Year:
2005

Citing 7
Cited 8

On an approximation measure founded on the links between optimization and polynomial approximation theory

Theoretical Computer Science
A tight analysis of the greedy algorithm for set cover

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Differential approximation algorithms for some combinatorial optimization problems

Theoretical Computer Science
z-Approximations

Journal of Algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
On the Structure of Combinatorial Problems and Structure Preserving Reductions

Proceedings of the Fourth Colloquium on Automata, Languages and Programming
The maximum saving partition problem

Operations Research Letters

A better differential approximation ratio for symmetric TSP

Theoretical Computer Science
New differential approximation algorithm for k-customer vehicle routing problem

Information Processing Letters
Efficient approximation of min set cover by moderately exponential algorithms

Theoretical Computer Science
Independent sets in bounded-degree hypergraphs

Discrete Applied Mathematics
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Survey: A survey on the structure of approximation classes

Computer Science Review
Independent sets in bounded-degree hypergraphs

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
SDP-based algorithms for maximum independent set problems on hypergraphs

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We present in this paper differential approximation results for MIN SET COVER and MIN WEIGHTED SET COVER. We first show that the differential approximation ratio of the natural greedy algorithm for MIN SET COVER is bounded below by 1.365/Δ and above by 4/(Δ + 1), where Δ is the maximum set-cardinality in the MIN SET COVER-instance. Next, we study another approximation algorithm for MIN SET COVER that computes 2-optimal solutions, i.e., solutions that cannot be improved by removing two sets belonging to them and adding another set not belonging to them. We prove that the differential approximation ratio of this second algorithm is bounded below by 2/(Δ + 1) and that this bound is tight. Finally, we study an approximation algorithm for MIN WEIGHTED SET COVER and provide a tight lower bound of 1/Δ. Our results identically hold for MAX HYPERGRAPH INDEPENDENT SET in both the standard and the differential approximation paradigms.