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
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms
A Constant-Factor Approximation Algorithm for the Multicommodity
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Approximating k-Set Cover and Complementary Graph Coloring
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Approximation Algorithms for Metric Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for 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
Network design for information networks
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Making routers last longer with ViAggre
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Facility location with hierarchical facility costs
ACM Transactions on Algorithms (TALG)
Approximation Algorithms for Multicommodity Facility Location Problems
SIAM Journal on Discrete Mathematics
Non-metric multicommodity and multilevel facility location
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Multicommodity facility location under group Steiner access cost
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
Multicommodity facility location refers to the extension of facility location to allow for different clients having demand for different goods, from among a finite set of goods. This leads to several optimization problems, depending on the costs of opening facilities (now a function of the commodities it serves). In this paper, we introduce and study some variants of multicommodity facility location, and provide approximation algorithms and hardness results for them.