Searching for ""Rent-or-Buy" Scheduling and Cost Coloring Problems." – sorted by Relevance.
-
rent-or-buy” scheduling and cost coloring problems
- “Rent-or-Buy” Scheduling and Cost Coloring Problems Takuro Fukunaga 1 , Magnús M. Halldórsson 2
- Cited by 1 (0 self) – Add To MetaCart
-
A constant-factor approximation algorithm for the multicommodity rent-or-buy problem
- simple function describing the cost of installing capacity. In the rent-or-buy problem, there are two
- Cited by 43 (5 self) – Add To MetaCart
-
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy
- a feasible solution of smallest total cost. The MROB problem generalizes the single-commodity rent-or-buy
- Cited by 10 (2 self) – Add To MetaCart
-
Approximation via costsharing: a simple approximation algorithm for the multicommodity rent-or-buy
- Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy
- Cited by 26 (5 self) – Add To MetaCart
-
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic steiner tree
- Simple Cost Sharing Schemes for Multicommodity Rent-or-Buy and Stochastic Steiner Tree Lisa
- Cited by 8 (1 self) – Add To MetaCart
-
A Constant-Factor Approximation Algorithm for the MulticommodityRent-or-Buy Problem
- -at-bulknetwork design with a simple function describing the cost of installing capacity. In the rent-or-buy problem
- Add To MetaCart
-
Group Strategyproof Mechanisms via Primal-Dual Algorithms
- result of the paper, which is a cross-monotonic cost sharing method for Single Source Rent-or-Buy Network
- Cited by 27 (1 self) – Add To MetaCart
-
É.: Cost-sharing mechanisms for network design
- for the rent-or-buy problem by carefully combining cost-shares for the simpler Steiner tree problem. Our
- Cited by 16 (3 self) – Add To MetaCart
-
Abstract Sharing the cost more efficiently: Improved Approximation for
- Abstract Sharing the cost more efficiently: Improved Approximation for Multicommodity Rent-or-Buy
- Add To MetaCart
-
Abstract Approximating Connected Facility Location Problems via Random Facility Sampling and
- . The special case where F = V and all opening costs are zero is known as the single-sink rent-or-buy problem
- Add To MetaCart

