The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong C...