About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
SODA 1999
Conference paper
Improved approximation algorithms for a capacitated facility location problem
Abstract
Algorithms for the metric variant of the capacitated facility location problem is investigated. The goal is to determine the number of facilities to install at each potential facility location and an assignment of each client to these facilities so as to minimize the overall total cost. The main result is a 3-approximation algorithm for the problem considered, improving on a 5.69-approximation algorithm.