Date of Original Version

6-2001

Type

Conference Proceeding

Abstract or Description

We study two versions of the single sink buy-at-bulk network design problem. We are given a network and a single sink, and several sources which demand a certain amount of flow to be routed to the sink. We are also given a finite set of cable types which have different cost characteristics and obey the principle of economies of scale. We wish to construct a minimum cost network to support the demands, using our given cable types. We study a natural integer program formulation of the problem, and show that its integrality gap is O(k), where k is the number of cable types. As a consequence, we also provide an O(k)-approximation algorithm.

DOI

10.1007/3-540-45535-3_14

Comments

Presented at 8th International IPCO Conference Utrecht, The Netherlands, June 13–15, 2001

Share

COinS
 

Published In

K. Aardal, B. Gerards (Eds.): IPCO 2001, LNCS 2081, 170-184.