Sciweavers

1389 search results - page 10 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
199
Voted
ESCAPE
2007
Springer
350views Algorithms» more  ESCAPE 2007»
15 years 8 months ago
An Approximation Algorithm for the General Mixed Packing and Covering Problem
Florian Diedrich, Klaus Jansen
118
Voted
COCOON
2010
Springer
15 years 7 months ago
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
Piotr Berman, Marek Karpinski, Andrzej Lingas
115
Voted
FOCS
1991
IEEE
15 years 6 months ago
Fast Approximation Algorithms for Fractional Packing and Covering Problems
Serge A. Plotkin, David B. Shmoys, Éva Tard...
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 7 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