We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...