In the single-sink buy-at-bulk network design problem we are given a subset of source nodes in a weighted undirected graph: each source node wishes to send a given amount of flow to a sink node. Moreover, a set of cable types is given, each characterized by a cost per unit length and by a capacity: the ratio cost/capacity decreases from small to large cables by economies of scale. The problem is to install cables on edges at minimum cost, such that the flow from each source to the sink can be routed simultaneously. The approximation ratio of this NP-hard problem was gradually reduced from O(log2 n) to 65.49 by a long series of papers. In this paper, we design a better 24.92 approximation algorithm for this problem. © 2006 Springer-Verlag Berlin/Heidelberg.
CITATION STYLE
Grandoni, F., & Italiano, G. F. (2006). Improved approximation for single-sink buy-at-bulk. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4288 LNCS, pp. 111–120). https://doi.org/10.1007/11940128_13
Mendeley helps you to discover research relevant for your work.