A separable assignment problem (SAP) is defined by a set of bins and a set of items to pack in each bin; a value, f, for assigning item j to bin i; and a separate packing constraint for each bin—i.e., ...

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

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

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

Abstract: Publish/subscribe communication systems where nodes subscribe to many different topics of interest are becoming increasingly more common. Designing overlay networks that connect the nodes ...