By Topic

Hardness of buy-at-bulk network design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Andrews, M. ; Bell Labs., Murray Hill, NJ, USA

We consider the buy-at-bulk 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 non-uniform. The problem is uniform otherwise. We show that for any constant γ, if NP

ZPTIME(npolylog n), then there is no O(log12 - γ/N)-approximation algorithm for non-uniform buy-at-bulk network design and there is no O(log14 - γ/N)-approximation algorithm for the uniform problem.

Published in:

Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on

Date of Conference:

17-19 Oct. 2004