270 search results - page 36 / 54 » Constraint relaxation in approximate linear programs |
114
Voted
DCC
2005
IEEE
16 years 1 days ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
133
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
116
click to vote
WEA
2010
Springer
15 years 7 months ago
2010
Springer
Resource leveling is a variant of resource-constrained project scheduling in which a non-regular objective function, the resource availability cost, is to be minimized. We present ...
77
Voted
EOR
2007
15 years 12 days ago
2007
Instead of selling advertisement spots one by one, some French satellite channels decided in 2002 to modify their commercial offer in order to sell packages of spots. These new g...
182
Voted
DC
2011
14 years 7 days ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...