• Mathematics, Computer Science
  • Published in SODA '07 2007

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

Figures and Topics from this paper.

Explore Further: Topics Discussed in This Paper

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

  • Ling Zhou, Arunabha Sen
  • Computer Science
  • IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference
  • 2007
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

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

Cost-distance: two metric network design

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Probabilistic approximation of metric spaces and its algorithmic applications

  • Yair Bartal
  • Computer Science
  • Proceedings of 37th Conference on Foundations of Computer Science
  • 1996
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL