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

C. Chekuri; M. T. Hajiaghayi; G. Kortsarz; M. R. Salavatipour

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

C. Chekuri, M. T. Hajiaghayi, G. Kortsarz, M. R. Salavatipour

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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 h is the number of pairs in the input. • An O(log h) approximation for the single-sink nonuniform buy-at-bulk network design. Unless P = NP this ratio is tight up to constant factors. • An O(log⁴ h) approximation for the multi-commodity non-uniform buy-at-bulk network design problem.

Original language	English
Title of host publication	Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007
Publisher	Association for Computing Machinery
Pages	1265-1274
Number of pages	10
ISBN (Electronic)	9780898716245
State	Published - 2007
Externally published	Yes
Event	18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 - New Orleans, United States Duration: 7 Jan 2007 → 9 Jan 2007

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Volume	07-09-January-2007

Conference

Conference	18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007
Country/Territory	United States
City	New Orleans
Period	7/01/07 → 9/01/07

Bibliographical note

Publisher Copyright:
Copyright © 2007 by the Association for Computing Machinery, Inc. and the Society for Industrial and Applied Mathematics.

Cite this

Chekuri, C., Hajiaghayi, M. T., Kortsarz, G., & Salavatipour, M. R. (2007). Approximation algorithms for node-weighted buy-at-bulk network design. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 (pp. 1265-1274). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; Vol. 07-09-January-2007). Association for Computing Machinery.

@inproceedings{2b015ca4177e43f9a0a5d21de9821b9b,

title = "Approximation algorithms for node-weighted buy-at-bulk network design",

abstract = "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 h is the number of pairs in the input. • An O(log h) approximation for the single-sink nonuniform buy-at-bulk network design. Unless P = NP this ratio is tight up to constant factors. • An O(log4 h) approximation for the multi-commodity non-uniform buy-at-bulk network design problem.",

author = "C. Chekuri and Hajiaghayi, {M. T.} and G. Kortsarz and Salavatipour, {M. R.}",

note = "Publisher Copyright: Copyright {\textcopyright} 2007 by the Association for Computing Machinery, Inc. and the Society for Industrial and Applied Mathematics.; 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 ; Conference date: 07-01-2007 Through 09-01-2007",

year = "2007",

language = "אנגלית",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "1265--1274",

booktitle = "Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007",

}

Chekuri, C, Hajiaghayi, MT, Kortsarz, G & Salavatipour, MR 2007, Approximation algorithms for node-weighted buy-at-bulk network design. in Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 07-09-January-2007, Association for Computing Machinery, pp. 1265-1274, 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, United States, 7/01/07.

Approximation algorithms for node-weighted buy-at-bulk network design. / Chekuri, C.; Hajiaghayi, M. T.; Kortsarz, G. et al.
Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, 2007. p. 1265-1274 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; Vol. 07-09-January-2007).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Chekuri, C.

AU - Hajiaghayi, M. T.

AU - Kortsarz, G.

AU - Salavatipour, M. R.

PY - 2007

Y1 - 2007

N2 - 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 h is the number of pairs in the input. • An O(log h) approximation for the single-sink nonuniform buy-at-bulk network design. Unless P = NP this ratio is tight up to constant factors. • An O(log4 h) approximation for the multi-commodity non-uniform buy-at-bulk network design problem.

AB - 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 h is the number of pairs in the input. • An O(log h) approximation for the single-sink nonuniform buy-at-bulk network design. Unless P = NP this ratio is tight up to constant factors. • An O(log4 h) approximation for the multi-commodity non-uniform buy-at-bulk network design problem.

UR - http://www.scopus.com/inward/record.url?scp=46749129237&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:46749129237

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 1265

EP - 1274

BT - Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007

PB - Association for Computing Machinery

T2 - 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007

Y2 - 7 January 2007 through 9 January 2007

ER -

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

Abstract

Publication series

Conference

Bibliographical note

Other files and links

Fingerprint

Cite this