STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Completeness in Approximation Classes
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
Weighted Node Coloring: When Stable Sets Are Expensive
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
An approximation algorithm to the k-Steiner Forest problem
Theoretical Computer Science
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
A note on the Clustered Set Covering Problem
Discrete Applied Mathematics
| Hi-index | 0.00 |
A lot of minimization covering problems on graphs consist in covering vertices or edges by subgraphs verifying a certain property. These problems can be seen as particular cases of set-covering. If the number of subgraphs is polynomial in the order n of the input-graph, then these problems can be approximated within logarithmic ratio by the classical greedy set-covering algorithm. We extend the class of problems approximable by this approach to covering problems where the number of candidate subgraphs is exponential in n, by revisiting an old technique called “master-slave” and extending it to weighted master or/and slave problems. Finally, we use the master-slave tool to prove some positive approximation results for two network-design and a VLSI-design graph-problems.