Efficient algorithms for the Max k-Vertex Cover problem

edge e containing the entire vertex set (ie., e = V ), any connected vertex cover of the new hypergraph is a vertex set of the initial hypergraph. Thus, we deduce that on the one

The weak connected vertex cover problem is as hard as the vertex cover problem in hy- pergraphs since starting from any hypergraph H = (V, E ) and by adding a new hyper- edge

We apply the technique to cactus graphs and chordal graphs and obtain new algorithms for solving the eternal vertex cover problem in linear time for cactus graphs and quadratic time

In particular, in the case of the minimum vertex cover problem, given full information, no polynomial time algorithm is known to achieve a better asymptotic performance ratio than 2:

By extending our previous charging scheme in a nontrivial manner, we are able to tackle the more general submodular version of online bipartite vertex cover and

Given a solution S for the Connected Minimal Clique Partition, the authors have shown in [DLP13] that we can construct a solution S ′ for the Connected Vertex Cover with

[SODA 2015], who independently showed that there are 1-pass parameterized streaming algorithms for Vertex Cover (a restriction of Min-Ones 2-SAT), we show using lower bounds

Keywords: algorithm; complexity; enumeration; listing; graph; data structure; exact exponential; com- putational biology; high-throughput sequencing; NGS; RNA-seq; alternative