Approximation Algorithms for Buy-at-Bulk Geometric Network Design

Czumaj, A., Czyzowicz, J., Gąsieniec, L., Jansson, J., Lingas, A. and Zylinski, P. (2009) Approximation Algorithms for Buy-at-Bulk Geometric Network Design. In: Algorithms and Data Structures. Lecture Notes in Computer Science, 5664 . Springer Verlag, pp. 168-180. ISBN 978-3-642-03366-7

[img] PDF
Restricted to Repository staff only
Download (269Kb)

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-at-bulk geometric network design problem with polynomial total demand. Then, for instances with few sinks and low capacity links, we design very fast polynomial-time low-constant approximations algorithms.

Item Type: Book Section
Uncontrolled Keywords: focs buy-at-bulk network
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science > Computer Science
Depositing User: Ms Saima Arif
Date Deposited: 06 Jan 2011 12:28
Last Modified: 26 Jul 2011 11:15
URI: http://eprints.dcs.warwick.ac.uk/id/eprint/583

Actions (login required)

View Item View Item