Sciweavers

1389 search results - page 10 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
COCOON
2010
Springer
13 years 11 months ago
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
Piotr Berman, Marek Karpinski, Andrzej Lingas
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
13 years 12 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito