On point covers of c-oriented polygons
Theoretical Computer Science
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Finding Essential Attributes from Binary Data
Annals of Mathematics and Artificial Intelligence
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms
Approximating edge dominating set in dense graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
| Hi-index | 0.00 |
We study dense cases of several covering problems. An instance of the set cover problem with $m$ sets is dense if there is $\epsilon