Results 1  10
of
1,774,803
BuyatBulk Network Design
"... Theessenceofthesimplestbuyatbulknetwork designproblemisbuyingnetworkcapacity"wholesale"toguaranteeconnectivityfromallnetwork nodestoacertaincentralnetworkswitch.Capacityissoldwith"volumediscount":themorecapacityisbought,thecheaperisthepriceperunit ofbandwidth.WeprovideO(log2n)r ..."
Abstract

Cited by 103 (0 self)
 Add to MetaCart
Theessenceofthesimplestbuyatbulknetwork designproblemisbuyingnetworkcapacity"wholesale"toguaranteeconnectivityfromallnetwork nodestoacertaincentralnetworkswitch.Capacityissoldwith"volumediscount":themorecapacityisbought,thecheaperisthepriceperunit ofbandwidth.WeprovideO(log2n
BuyatBulk Network Design with Protection
"... We consider approximation algorithms for buyatbulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In practice, the most popular model used in high speed telecommunication networks for protection against failures, is the s ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
We consider approximation algorithms for buyatbulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In practice, the most popular model used in high speed telecommunication networks for protection against failures
Approximation Algorithms for NodeWeighted BuyatBulk Network Design
"... We present algorithms with polylogarithmic approximation ratios for the buyatbulk network design problem in the nodeweighted setting. We obtain the following results where h is the number of pairs in the input. * An O(log h) approximation for the singlesink nonuniform buyatbulk network desig ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
We present algorithms with polylogarithmic approximation ratios for the buyatbulk network design problem in the nodeweighted setting. We obtain the following results where h is the number of pairs in the input. * An O(log h) approximation for the singlesink nonuniform buyatbulk network
Approximation algorithms for nonuniform buyatbulk network design problems
 Proc. of IEEE FOCS
"... Abstract. Buyatbulk network design problems arise in settings where the costs for purchasing or installing equipment exhibit economies of scale. The objective is to build a network of cheapest cost to support a given multicommodity flow demand between node pairs. We present approximation algorith ..."
Abstract

Cited by 56 (13 self)
 Add to MetaCart
Abstract. Buyatbulk network design problems arise in settings where the costs for purchasing or installing equipment exhibit economies of scale. The objective is to build a network of cheapest cost to support a given multicommodity flow demand between node pairs. We present approximation
An Oblivious Spanning Tree for BuyatBulk Network Design Problems
"... We consider the problem of constructing a single spanning tree for the singlesource buyatbulk network design problem for doublingdimension graphs. We compute a spanning tree to route a set of demands (or data) along a graph to or from a designated root node. The demands could be aggregated at (o ..."
Abstract
 Add to MetaCart
We consider the problem of constructing a single spanning tree for the singlesource buyatbulk network design problem for doublingdimension graphs. We compute a spanning tree to route a set of demands (or data) along a graph to or from a designated root node. The demands could be aggregated
On nonuniform multicommodity buyatbulk network design
 Proc. of ACM STOC
, 2005
"... We study the multicommodity buyatbulk network design problem in which we seek to design a network that satisfies the demands between terminals from a given set of sourcesink pairs. The key characteristic of this problem is the fact that the cost functions associated with the edges of the graph are ..."
Abstract

Cited by 35 (1 self)
 Add to MetaCart
We study the multicommodity buyatbulk network design problem in which we seek to design a network that satisfies the demands between terminals from a given set of sourcesink pairs. The key characteristic of this problem is the fact that the cost functions associated with the edges of the graph
On the Integrality Gap of a Natural Formulation of the SingleSink Buyatbulk Network Design Problem
, 2001
"... We study two versions of the single sink buyatbulk network design problem. We are given a network and a single sink, and several sources which demand a certain amount of ow to be routed to the sink. ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
We study two versions of the single sink buyatbulk network design problem. We are given a network and a single sink, and several sources which demand a certain amount of ow to be routed to the sink.
Approximation Algorithms for NonUniform BuyatBulk NetworkDesign
, 2006
"... Abstract We consider approximation algorithms for nonuniformbuyatbulk network design problems. The first nontrivial approximation algorithm for this problem is due toCharikar and Karagiozova (STOC ' 05); for an instance on h pairs their algorithm has an approximation guarantee of exp( O(plo ..."
Abstract
 Add to MetaCart
Abstract We consider approximation algorithms for nonuniformbuyatbulk network design problems. The first nontrivial approximation algorithm for this problem is due toCharikar and Karagiozova (STOC ' 05); for an instance on h pairs their algorithm has an approximation guarantee of exp( O
LPbased Approximation Algorithms for Facility Location in BuyatBulk Network Design
"... Abstract We study problems that integrate buyatbulk network design into the classical (connected) facility location problem. In such problems, we need to open facilities, build a routing network, and route every client demand to an open facility. Furthermore, capacities of the edges can be purchas ..."
Abstract
 Add to MetaCart
Abstract We study problems that integrate buyatbulk network design into the classical (connected) facility location problem. In such problems, we need to open facilities, build a routing network, and route every client demand to an open facility. Furthermore, capacities of the edges can
Parallel Probabilistic Tree Embeddings, kMedian, and BuyatBulk Network Design
"... This paper presents parallel algorithms for embedding an arbitrary npoint metric space into a distribution of dominating trees with O(log n) expected stretch. Such embedding has proved useful in the design of many approximation algorithms in the sequential setting. We give a parallel algorithm that ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
these results, we give an RNC O(log k)approximation algorithm for kmedian and an RNC O(log n)approximation for buyatbulk network design. The kmedian algorithm is the first RNC algorithm with nontrivial guarantees for arbitrary values of k, and the buyatbulk result is the first parallel algorithm
Results 1  10
of
1,774,803