e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
Approximation algorithms
Approximating k-Set Cover and Complementary Graph Coloring
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Facility Location with Nonuniform Hard Capacities
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Local Search Heuristics for k-Median and Facility Location Problems
SIAM Journal on Computing
Multicommodity facility location
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Facility location with Service Installation Costs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
Mathematics of Operations Research
Facility location with hierarchical facility costs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
| Hi-index | 0.00 |
Multicommodity facility location refers to the extension of facility location to allow for different clients' demands for different goods from among a finite set of goods. This leads to several optimization problems, depending on the cost of opening a facility (now a function of the commodities it serves). In this paper, we introduce and provide approximation algorithms for two fairly general versions of multicommodity facility location. We formulate integer programming models for these problems, and use them to provide approximation algorithms for the problems that are close to the inapproximability thresholds.