105 search results - page 1 / 21 » Improved approximation algorithms for minimum-weight vertex ... |
SIAMCOMP
2008
13 years 4 months ago
2008
COCOON
2004
Springer
13 years 10 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
WG
2007
Springer
13 years 11 months ago
2007
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 ...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
