
A new lower bound for eternal vertex cover number
We obtain a new lower bound for the eternal vertex cover number of an ar...
read it

Tight Bounds for Potential Maximal Cliques Parameterized by Vertex Cover
We show that a graph with n vertices and vertex cover of size k has at m...
read it

Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams
In this paper, we give simple optimal lower bounds on the oneway twopa...
read it

Efficiently Approximating Vertex Cover on ScaleFree Networks with Underlying Hyperbolic Geometry
Finding a minimum vertex cover in a network is a fundamental NPcomplete...
read it

A lower bound for splines on tetrahedral vertex stars
A tetrahedral complex all of whose tetrahedra meet at a common vertex is...
read it

Efficient algorithms for computing a minimal homology basis
Efficient computation of shortest cycles which form a homology basis und...
read it

Ultimate greedy approximation of independent sets in subcubic graphs
We study the approximability of the maximum size independent set (MIS) p...
read it
A modified greedy algorithm to improve bounds for the vertex cover number
In any attempt at designing an efficient algorithm for the minimum vertex cover problem, obtaining good upper and lower bounds for the vertex cover number could be crucial. In this article we present a modified greedy algorithm of worstcase time complexity O(n3) to obtain bounds for the vertex cover number of an input graph of order n. Using simple facts, the proposed algorithm computes a lower bound for the vertex cover number. Then using this lower bound it outputs a minimal vertex cover and hence gives an upper bound. The algorithm ensures the output vertex cover is always minimal, which feature is an improvement upon the existing greedy algorithms.
READ FULL TEXT
Comments
There are no comments yet.