Improved approximation of maximum vertex cover

Authors:
Anna Galluccio;Paolo Nobili
Affiliations:
Instituto di Analisi dei Sistemi ed Informatica "A. Ruberti" - CNR, Viale Manzoni 30, 00185 Roma, Italy;Dipartimento di Matematica, Universití di Lecce, via Arnesano, 73100 Lecce and IASI-CNR, Italy
Venue:
Operations Research Letters
Year:
2006

Citing 6
Cited 1

A probabilistic analysis of the maximal covering location problem

Discrete Applied Mathematics - Special issue: local optimization
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem

SIAM Journal on Discrete Mathematics
Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems

Approximation algorithms for NP-hard problems
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Cardinality constrained path covering problems in grid graphs

Networks

The maximum vertex coverage problem on bipartite graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a new LP relaxation of the maximum vertex cover problem and a polynomial-time algorithm that finds a solution within the approximation factor 1-1/(2q@?), where q@? is the size of the smallest clique in a given clique-partition of the edge weighting of G.