Join Our Newsletter

142 search results - page 1 / 29» An Approximation Algorithm for Weighted Weak Vertex Cover Pr... |

COCOON

2004

Springer

9 years 11 months ago
2004

Springer

The problem of eﬃciently monitoring the network ﬂow is regarded as the one to ﬁnd out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...

WAOA

2005

Springer

9 years 11 months ago
2005

Springer

A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...

CORR

2006

Springer

9 years 5 months ago
2006

Springer

A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...

PODC

2009

ACM

10 years 6 months ago
2009

ACM

The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...

WG

2007

Springer

9 years 12 months ago
2007

Springer