5624 search results - page 6 / 1125 » On Conditional Covering Problem |
63
Voted
JGT
2008
14 years 11 months ago
2008
We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1-factors whose union is the whole graph and, when these conditions are satisf...
101
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
BIRTHDAY
2009
Springer
15 years 6 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
CAV
2010
Springer
15 years 3 months ago
2010
Springer
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
119
click to vote
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...