93 search results - page 3 / 19 » Online Primal-Dual Algorithms for Covering and Packing Probl... |
79
Voted
WADS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
ESA
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
126
Voted
SIGECOM
2011
ACM
14 years 1 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
105
Voted
ESA
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We study an online version of Fisher's linear case market. In this market there are m buyers and a set of n dividable goods to be allocated to the buyers. The utilit...
152
Voted
DC
2011
13 years 10 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...