F.A. Chudak and D.P. Williamson. Improved approximation algorithms for capacitated facility location problems. Proceedings of the 7th Conference on Integer Programming and Combinatorial Optimization, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Local Search Heuristics for k-median and Facility.. - Arya, Garg.. (2002) (29 citations) (Correct)
....locality gap of this local search procedure. For 1 CFL with uniform capacities, Korupolu et al. 14, 15] argued that any procedure that permits adding, dropping or swapping a facility has a locality gap of at most 8. Their analysis was subsequently re ned and tightened by Chudak and Williamson [6] to yield a locality gap of at most 6. P al et al. 13] present a local search algorithm for facility location with non uniform hard capacities which yields a 9 approximation. For the uncapacitated version, Korupolu et al. 14, 15] provide a bound of 5 on the locality gap when the only ....
F. Chudak and D. Williamson. Improved approximation algorithms for capacitated facility location problems. In Proceedings of the 7th Conference on Integer Programming and Combinatorial Optimization, June 1999.
Local Search Heuristics for k-median and Facility.. - Arya, Garg.. (2002) (29 citations) (Correct)
....to improve the approximation guarantee of UFL to 2.408. This was further improved to (1 2=e) by Chudak [4] and nally to 1:728 by Charikar and Guha [3] Similar ideas A cotree in a connected graph is a subset of edges that is the complement of a spanning tree. were used by Chudak and Shmoys [5] to obtain a 3 approximation algorithm for 1 CFL when the capacities are uniform. Jain and Vazirani [8] obtained a 4 approximation algorithm for 1 CFL when the capacities were non uniform by solving a related UFL problem using their primal dual algorithm. Our Results: In this paper, we analyze ....
F. Chudak and D. Shmoys. Improved approximation algorithms for capacitated facility location problem. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, january 1999.
On the Integrality Gap of Capacitated Facility Location - Abrams, Meyerson.. (Correct)
....hard [7] and has several constant factor approximations, using local search [3, 12, 1] linear program rounding [14, 18] and primal dual approach [10] to mention a few. In addition, there has been work on capacitated facility location where either the capacities are the same on all facilities [12, 5], or where we are allowed multiple copies of a facility at a location [4, 10] There has also been some previous work on facility location with lower bounds [11, 8, 9] We consider both upper and lower bounds in our formulation. 2 Non uniform Capacitated Facility Location In this section, we ....
F. Chudak and D. Williamson. Improved approximation algorithms for capacitated facility location problems. Proceedings of 7th IPCO Conference, 1999.
On the Integrality Gap of Capacitated Facility Location - Abrams, Meyerson.. (Correct)
....[3, 12, 1] linear program rounding [14, 18] and primal dual approach [10] to mention a few. In addition, there has been work on capacitated facility location where either the capacities are the same on all facilities [12, 5] or where we are allowed multiple copies of a facility at a location [4, 10]. There has also been some previous work on facility location with lower bounds [11, 8, 9] We consider both upper and lower bounds in our formulation. 2 Non uniform Capacitated Facility Location In this section, we present an algorithm for the version of the problem without the lower bounds. ....
F. Chudak and D. Shmoys. Improved approximation algorithms for the capacitated facility location problem. Proceedings of 10th ACM-SIAM SODA, 1999.
Improved Approximation Algorithms for - Capacitated Facility Location Self-citation (Chudak) (Correct)
No context found.
F. Chudak and D.B. Shmoys. Improved approximation algorithms for a capacitated facility location problem. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 875--876, 1999.
Online Algorithms for Network Design - Meyerson (2003) (Correct)
No context found.
F.A. Chudak and D.P. Williamson. Improved approximation algorithms for capacitated facility location problems. Proceedings of the 7th Conference on Integer Programming and Combinatorial Optimization, 1999.
Online Algorithms for Network Design - Meyerson (2003) (Correct)
No context found.
F.A. Chudak and D. B. Shmoys. Improved approximation algorithms for capacitated facility location problem. Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, 1999.
A Multi-Exchange Local Search Algorithm for the Capacitated.. - Zhang, Chen, Ye (2004) (6 citations) (Correct)
No context found.
F. A. Chudak and D. Williamson, "Improved approximation algorithms for capacitated facility location problems," in Proceedings of the 7th Conference on Integer Programming and Combinatorial Optimization (IPCO'99), 99-113, 1999.
A Simple and Deterministic Competitive Algorithm.. - Anagnostopoulos.. (Correct)
No context found.
F. A. Chudak and D. B. Shmoys. Improved approximation algorithms for a capacitated facility location problem. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '99), pages 875--876, N.Y., Jan. 17--19 1999. ACM-SIAM.
A Multi-Exchange Local Search Algorithm for the Capacitated.. - Zhang, Chen, Ye (2003) (6 citations) (Correct)
No context found.
F. A. Chudak and D. Williamson, "Improved approximation algorithms for capacitated facility location problems," in Proceedings of the 7th Conference on Integer Programming and Combinatorial Optimization (IPCO'99), 99-113, 1999.
Unknown - Madhukar Korupolu Placement (Correct)
No context found.
F. A. Chudak and D. Williamson. Improved approximation algorithms for capacitated facility location problems. In Proceedings of the 7th Conference on Integer Programming and Combinatorial Optimization, June 1999. To appear.
Unknown - Madhukar Korupolu Placement (Correct)
No context found.
F. A. Chudak and D. Shmoys. Improved approximation algorithms for a capac- itated facility location problem. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages S875--S876, January 1999.
Adaptive Beacon Placement - Bulusu, Heidemann, Estrin (2001) (28 citations) (Correct)
No context found.
David Shmoys and F. A. Chudak. Improved approximation algorithms for capacitated facility location problems. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages S875{S876, 1999.
Approximation Algorithms for Metric Facility Location and.. - Jain, Vazirani (2001) (154 citations) (Correct)
No context found.
F. A. Chudak and D. P. Williamson. Improved approximation algorithms for capacitated facility location problems. Proc. Integer Programming and Combinatorial Optimization, 1999.
Approximation Algorithms for Metric Facility Location and.. - Jain, Vazirani (2001) (154 citations) (Correct)
No context found.
F. Chudak and D. Shmoys. Improved approximation algorithms for the capacitated facility location problem. Proc. 10th ACM-SIAM Symp. on Discrete Algorithms, S875-S876, 1999.
Covering Graphs Using Trees and Stars - Even, Garg, Könemann, Ravi, Sinha (Correct)
No context found.
F. Chudak and D. Shmoys. Improved approximation algorithms for a capacitated facility location problem. In Proceedings of the 10 Annual ACM-SIAM Symposium on Discrete Algorithms, 875-876, 1999.
Improved Approximation Algorithms for Metric Facility.. - Mahdian, Ye, Zhang (2002) (117 citations) (Correct)
No context found.
F.A. Chudak and D. Shmoys. Improved approximation algorithms for the capacitated facility location problem. In Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 875-876, 1999.
A Multi-Exchange Local Search Algorithm for the Capacitated.. - Zhang, Chen, Ye (2004) (6 citations) (Correct)
No context found.
F. A. Chudak and D. Williamson, "Improved approximation algorithms for capacitated facility location problems," in Proceedings of the 7th Conference on Integer Programming and Combinatorial Optimization (IPCO'99), 99-113, 1999.
Approximation Algorithms for Metric Facility Location Problems - Mahdian, Ye, Zhang (2004) (2 citations) (Correct)
No context found.
F.A. Chudak and D. Shmoys. Improved approximation algorithms for the capacitated facility location problem. In Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 875--876, 1999. 14
A Simple and Deterministic Competitive Algorithm.. - Anagnostopoulos.. (2003) (Correct)
No context found.
F. A. Chudak and D. B. Shmoys. Improved approximation algorithms for a capacitated facility location problem. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '99), pages 875--876, N.Y., Jan. 17--19 1999. ACM-SIAM.
Analysis of a Local Search Heuristic for Facility.. - Korupolu, Plaxton.. (2000) (211 citations) (Correct)
No context found.
F. A. Chudak and D. Williamson. Improved approximation algorithms for capacitated facility location problems. In Proceedings of the 7th Conference on Integer Programming and Combinatorial Optimization, pages 99--113, June 1999.
Analysis of a Local Search Heuristic for Facility.. - Korupolu, Plaxton.. (2000) (211 citations) (Correct)
No context found.
F. A. Chudak and D. Shmoys. Improved approximation algorithms for a capacitated facility location problem. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 875--876, January 1999.
Enhancing Techniques in LP Based Approximation Algorithms - Jain (Correct)
No context found.
F. A. Chudak and D. P. Williamson. Improved approximation algorithms for capacitated facility location problem. In Proc. Integer Programming and Combinatorial Optimization, 1999.
Enhancing Techniques in LP Based Approximation Algorithms - Jain (Correct)
No context found.
F. Chudak and D. Shmoy. Improved approximation algorithms for the capacitated facility location problem. In Proc. 10th annual Symposium on Discrete Algorithm, pages S875--S876, 1999. 131
Capacitated Vertex Covering with Applications - Sudipto Guha Refael (2002) (1 citation) (Correct)
No context found.
F. Chudak and D. Williamson, "Improved approximation algorithms for capacitated facility location problems ", Proc of 1999.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC