We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
We consider the problem of minimum distortion intrinsic correspondence between deformable shapes, many useful formulations of which give rise to the NP-hard quadratic assignment p...
— Multi-agent coordination problems can be cast as distributed optimization tasks. Probability Collectives (PCs) are techniques that deal with such problems in discrete and conti...
Abstract— Memetic algorithms arise as very effective algorithms to obtain reliable and high accurate solutions for complex continuous optimization problems. Nowadays, high dimens...
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...