Approximation Algorithms for Buy-at-Bulk Geometric Network Design

Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all points in a Euclidean space are candidates for network nodes. We present the first general approach for geometric versions of basic variants of the buy-at-bulk network design problem. It enables us to obtain quasi-polynomial-time approximation schemes for basic variants of the buy-atbulk geometric network design problem with polynomial total demand. Then, for instances with few sinks and low capacity links, we design very fast polynomialtime low-constant approximations algorithms.

• Type: Conference
• Year: 2009
• Where: WADS
• Authors: Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Pawel Zylinski
• Keywords: Algorithms, Buy-at-bulk Network Design, Geometric Versions, Network Design Problem, WADS 2009