The Library
Approximation algorithms for buy-at-bulk geometric network design
Tools
Tools
Tools
Czumaj, Artur, 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 9783642033667
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/978-3-642-03367-4_15
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 Item |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software |
| Divisions: | Faculty of Science > Computer Science |
| Series Name: | Lecture Notes in Computer Science |
| Publisher: | Springer Verlag |
| ISBN: | 9783642033667 |
| Book Title: | Algorithms and data structures |
| Date: | 2009 |
| Number: | 5664 |
| Page Range: | pp. 168-180 |
| Identification Number: | 10.1007/978-3-642-03367-4_15 |
| Status: | Not Peer Reviewed |
| Publication Status: | Published |
| Related URLs: | |
| URI: | http://wrap.warwick.ac.uk/id/eprint/47505 |
Actions (login required)
 |
View Item |
