— This paper studies consensus seeking over noisy networks with time-varying noise statistics. Stochastic approximation type algorithms can ensure consensus in mean square and wi...
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
Abstract. We present randomized approximation algorithms for multicriteria Max-TSP. For Max-STSP with k > 1 objective functions, we obtain an approximation ratio of 1 k - for a...