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 ...

Abstract: The present work studies a maximum multicommodity flow problem with local constrains, which not only enrich the content of the multicommodity flow problem, but also can be used to operate ...

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 ...

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 ...

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 ...

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 ...

Nathan Klein receives funding from the National Science Foundation. Computers are good at answering questions. What’s the shortest route from my house to Area 51? Is 8,675,309 a prime number? How many ...