58 search results - page 2 / 12 » Fast Approximation Algorithms for Fractional Packing and Cov... |
207
Voted
DC
2011
14 years 2 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
140
Voted
ICCSA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
147
Voted
ESA
2005
Springer
15 years 8 months ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
138
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
201
Voted
ESCAPE
2007
Springer
15 years 9 months ago
2007
Springer