
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04)
Hardness of BuyatBulk Network Design
Rome, Italy
October 17October 19
ISBN: 0769522289
ASCII Text  x  
Matthew Andrews, "Hardness of BuyatBulk Network Design," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 115124, 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), 2004.  
BibTex  x  
@article{ 10.1109/FOCS.2004.32, author = {Matthew Andrews}, title = {Hardness of BuyatBulk Network Design}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {2004}, issn = {02725428}, pages = {115124}, doi = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2004.32}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  Hardness of BuyatBulk Network Design SN  02725428 SP115 EP124 A1  Matthew Andrews, PY  2004 KW  null VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2004.32
We consider the BuyatBulk network design problem in which we wish to design a network for carrying multicommodity demands from a set of source nodes to a set of destination nodes. The key feature of the problem is that the cost of capacity on each edge is concave and hence exhibits economies of scale. If the cost of capacity per unit length can be different on different edges then we say that the problem is nonuniform. The problem is uniform otherwise.
We show that for any constant γ, if NP ⊆ ZIPTIME(n^polylog n) then there is no 0(\log ^{\frac{1}{2}  \gamma } N)approximation algorithm for nonuniform BuyatBulk network design and there is no 0(\log ^{\frac{1}{4}  \gamma } N)approximation algorithm for the uniform problem.
Citation:
Matthew Andrews, "Hardness of BuyatBulk Network Design," focs, pp.115124, 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.