The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...
This paper introduces an approach to locating dependence structures in a program by searching the space of the powerset of the set of all possible program slices. The paper formul...
Abstract. Caching frequently accessed data at the client is an attractive technique for improving access time. In a mobile computing environment, client location becomes a piece of...
Jianliang Xu, Xueyan Tang, Dik Lun Lee, Qinglong H...