Results 1  10
of
468,780
A ConstantFactor Approximation Algorithm for the Multicommodity RentorBuy Problem
"... ... Recent work on buyatbulk network design has concentrated on the special case where all sinks are identical; existing constantfactor approximation algorithms for this special case make crucial use of the assumption that all commodities ship flow to the same sink vertex and do not obviously ext ..."
Abstract

Cited by 100 (10 self)
 Add to MetaCart
extend to the multicommodity rentorbuy problem. Prior to our work, the best heuristics for the multicommodity rentorbuy problem achieved only logarithmic performance guarantees and relied on the machinery of relaxed metrical task systems or of metric embeddings. By contrast, we solve the network
A ConstantFactor Approximation Algorithm for the MulticommodityRentorBuy Problem
"... Abstract We present the first constantfactor approximation algorithm for network design with multiple commodities and economiesof scale. We consider the rentorbuy problem, a type of multicommodity buyatbulk network design in which there are two ways to install capacity on any given edge. Capaci ..."
Abstract
 Add to MetaCart
Abstract We present the first constantfactor approximation algorithm for network design with multiple commodities and economiesof scale. We consider the rentorbuy problem, a type of multicommodity buyatbulk network design in which there are two ways to install capacity on any given edge
Approximation via costsharing: a simple approximation algorithm for the multicommodity rentorbuy problem
 In IEEE Symposium on Foundations of Computer Science (FOCS
, 2003
"... We study the multicommodity rentorbuy problem, a type of network design problem with economies of scale. In this problem, capacity on an edge can be rented, with cost incurred on a perunit of capacity basis, or bought, which allows unlimited use after payment of a large fixed cost. Given a graph ..."
Abstract

Cited by 48 (8 self)
 Add to MetaCart
We study the multicommodity rentorbuy problem, a type of network design problem with economies of scale. In this problem, capacity on an edge can be rented, with cost incurred on a perunit of capacity basis, or bought, which allows unlimited use after payment of a large fixed cost. Given a graph
Approximation Via CostSharing: A Simple Approximation Algorithm for theMulticommodity RentorBuy Problem
"... 1 Introduction We study the multicommodity rentorbuy (MRoB) problem. In this problem, we are given an undirected graph G = (V; E) with nonnegative weights ce on the edges anda set ..."
Abstract
 Add to MetaCart
1 Introduction We study the multicommodity rentorbuy (MRoB) problem. In this problem, we are given an undirected graph G = (V; E) with nonnegative weights ce on the edges anda set
Sharing the cost more efficiently: Improved approximation for multicommodity rentorbuy
, 2007
"... In the multicommodity rentorbuy (MROB) network design problem we are given a network together with a set of k terminal pairs (s1, t1),..., (sk, tk). The goal is to provision the network so that a given amount of flow can be shipped between si and ti for all 1 ≤ i ≤ k simultaneously. In order to pr ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
In the multicommodity rentorbuy (MROB) network design problem we are given a network together with a set of k terminal pairs (s1, t1),..., (sk, tk). The goal is to provision the network so that a given amount of flow can be shipped between si and ti for all 1 ≤ i ≤ k simultaneously. In order
Stochastic Steiner Trees without a Root
"... This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [14], tries to capture the fact that many infrastructure planningproblems have to be solved in the presence of uncertainty, and that we have ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
in this paper are powerfulenough to solve the Multicommodity RentorBuy problem, themselves a topic of much recent interest [68].
A simpler and better derandomization of an approximation algorithm for Single Source RentorBuy
"... We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar and Roughgarden for Single Source RentorBuy by using the method of conditional expectation. Using the improved analysis of Eisenbrand, Grandoni and Rothvoß, our derandomized algorithm has an approximation guarante ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar and Roughgarden for Single Source RentorBuy by using the method of conditional expectation. Using the improved analysis of Eisenbrand, Grandoni and Rothvoß, our derandomized algorithm has an approximation
rentorbuy” scheduling and cost coloring problems
 In Foundations of Software Technology and Theoretical Computer Science (FSTTCS
, 2007
"... Abstract. We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the color classes. The “RentorBuy ” scheduling/coloring problem (RBC) is one that captures e.g., job scheduling ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the color classes. The “RentorBuy ” scheduling/coloring problem (RBC) is one that captures e.g., job scheduling
Results 1  10
of
468,780