Results 1  10
of
738,235
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
algorithms for buyatbulk network design problems with costs on both edges and nodes of an undirected graph. Our main result is the first polylogarithmic approximation ratio for the nonuniform problem that allows different cost functions on each edge and node; the ratio we achieve is O(log4 h) where h
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
Improved Approximation for SingleSink BuyatBulk
"... In the singlesink buyatbulk network design problem we are given a subset of source nodes in a weighted undirected graph: each source node wishes to send a given amount of flow to a sink node. Moreover, a set of cable types is given, each characterized by a cost per unit length and by a capacity: ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
In the singlesink buyatbulk network design problem we are given a subset of source nodes in a weighted undirected graph: each source node wishes to send a given amount of flow to a sink node. Moreover, a set of cable types is given, each characterized by a cost per unit length and by a capacity
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
Approximating BuyatBulk kSteiner trees
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 7 (2006)
, 2006
"... In the buyatbulk kSteiner tree (or rentorbuy kSteiner tree) problem we are given a graph G(V, E) with a set of terminals T ⊆ V including a particular vertex s called the root, and an integer k ≤ T . There are two cost functions on the edges of G, a buy cost b: E − → R + and a rent cost r: E ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
algorithm for the bicriteria Steiner tree problem. Their algorithm does not extend to the bicriteria kSteiner tree problem. Our algorithm for the buyatbulk kSteiner tree problem relies on an (O(log2 n), O(log4 n))approximation algorithm we develop for the (shallowlight) bicriteria kSteiner tree
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
Oblivious BuyatBulk in Planar Graphs
, 2011
"... In the oblivious buyatbulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of sourcedestination in the graph, such that any set of demands can be routed along these paths. The demands could be aggregated at intermediate edges where the fusioncost i ..."
Abstract
 Add to MetaCart
In the oblivious buyatbulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of sourcedestination in the graph, such that any set of demands can be routed along these paths. The demands could be aggregated at intermediate edges where the fusion
Results 1  10
of
738,235