In this article, we will formalize the method of dual fitting and the idea of factor-revealing LP.
This combination is used to design and analyze two greedy algorithms for the metric …

We present a simple and natural greedy algorithm for the metric uncapacitated facility
location problem achieving an approximation guarantee of 1.61. We use this algorithm to …

Consider a setting in which a group of nodes, situated in a large underlying network, wishes
to reserve bandwidth on which to support communication. Virtual private networks (VPNs) …

We consider the problem of finding efficient trees to send information from k sources to a
single sink in a network where information can be aggregated at intermediate nodes in the …

Gives constant approximations for a number of layered network design problems. We begin
by modeling hierarchical caching, where the caches are placed in layers and each layer …

Abstract We consider the Connected Facility Location problem. We are given a graph
G=(V,E) with costs {c_e\} on the edges, a set of facilities \F⊆V, and a set of clients \D⊆V …

Recently, the study of I/O-efficient algorithms has moved beyond fundamental problems of
sorting and permuting and into wider areas such as computational geometry and graph …

In this article, we focus on international facility location models. First, we conduct an
extensive literature review on the subject and we propose a classification of the surveyed …

We present the Cost-Distance problem: finding a Steiner tree which optimizes the sum of
edge costs along one metric and the sum of source-sink distances along an unrelated …

Buy-at-bulk network design problems arise in settings where the costs for purchasing or
installing equipment exhibit economies of scale. The objective is to build a network of …