# Approximation algorithms for node-weighted buy-at-bulk network design

@inproceedings{Chekuri2007ApproximationAF, title={Approximation algorithms for node-weighted buy-at-bulk network design}, author={Chandra Chekuri and Mohammad Taghi Hajiaghayi and Guy Kortsarz and Mohammad R. Salavatipour}, booktitle={SODA '07}, year={2007} }

We present algorithms with poly-logarithmic approximation ratios for the buy-at-bulk network design problem in the node-weighted setting. We obtain the following results where <i>h</i> is the number of pairs in the input.
• On <i>O</i>(log <i>h</i>) approximation for the single-sink non-uniform buy-at-bulk network design. Unless <i>P</i> = <i>NP</i> this ratio is tight up to constant factors.
• An <i>O</i>(log<sup>4</sup> <i>h</i>) approximation for the multi-commodity non-uniform buy-at-bulk… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 21 CITATIONS

## Online Buy-at-Bulk Network Design

VIEW 9 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

## Topology Design of Service Overlay Network with a Generalized Cost Model

VIEW 7 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## An Approximation Algorithm for Constructing Degree-Dependent Node-Weighted Multicast Trees

VIEW 4 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Approximating Some Network Design Problems with Node Costs

VIEW 6 EXCERPTS

CITES METHODS & BACKGROUND

## Buy-at-Bulk Network Design with Protection

VIEW 4 EXCERPTS

CITES BACKGROUND

## Computing Vertex-Weighted Multi-Level Steiner Trees

VIEW 1 EXCERPT

CITES BACKGROUND

## The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems

VIEW 1 EXCERPT

CITES BACKGROUND

## Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing

VIEW 1 EXCERPT

CITES BACKGROUND

## Host-Bypass : Approximating Node-weighted Connectivity Problems In Two-Tier Networks

VIEW 1 EXCERPT

CITES METHODS

#### References

##### Publications referenced by this paper.

SHOWING 1-5 OF 5 REFERENCES

## A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees

VIEW 14 EXCERPTS

HIGHLY INFLUENTIAL

## A constant factor approximation for the single sink edge installation problems

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Cost-distance: two metric network design

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## Efficient recovery from power outage (extended abstract)

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Probabilistic approximation of metric spaces and its algorithmic applications

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL