where for any $F \subseteq V,d(j,F) = \min _{feF} d(j,f)$ . This is a "min-max" or "robust" version of the k-median problem. Note that in contrast to the recent ...

In this talk we will present approximation algorithms (and general techniques) for some basic problems in the field of stochastic optimization. A canonical problem is stochastic knapsack: we are given ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...

In recent years approximation algorithms based on primal-dual methods have been successfully applied to a broad class of discrete optimization problems. In this paper, we propose a generic primal-dual ...

We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it ...

Abstract: In this paper, a double-linear approximation algorithm (DLAA) to achieve maximum-power-point tracking (MPPT) for PV arrays is proposed. The DLAA is based on that the trajectories of maximum ...