Fabián A. Chudak, David B. Shmoys  Home/Search
Context Related
| cornell.edu/~shmoys/capfl.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cornell.edu/home/shmoys/shmoys (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the following capacitated facility location problem. There is a set of demand locations that require service from facilities; there is a set of locations at which facilities can be built, where the capacity installed at each location i is an integer multiple of u, with a cost incurred equal to the corresponding multiple of f i . If the demand at location j is serviced by a facility at location i, then a cost of c ij is incurred. The objective is to determine the capacity to... (Update)
Cited by: More
Online Algorithms for Network Design - Meyerson (2003) (Correct)
A Multi-Exchange Local Search Algorithm for the Capacitated.. - Zhang, Chen, Ye (2004) (Correct)
A Simple and Deterministic Competitive Algorithm.. - Anagnostopoulos.. (Correct)
Active bibliography (related documents): More All
3.1: Approximation Algorithms for Facility Location Problems - Jens Vygen (2005) (Correct)
0.1: From Stars to Comets: - Improved Local Search (Correct)
0.1: Improved Approximation Algorithms for Capacitated Facility.. - Chudak, Williamson (1999) (Correct)
Similar documents based on text: More All
1.1: A 3-Approximation Algorithm for the k-Level Uncapacitated .. - Aardal, Chudak, Shmoys (1999) (Correct)
1.1: A Multi-Exchange Heuristic for the Single Source Capacitated.. - Ahuja, Orlin (2002) (Correct)
1.1: A New Greedy Approach for Facility Location Problems - Jain, Mahdian, Saberi (Correct)
Related documents from co-citation: More All
53: Approximation algorithms for facility location problems - Shmoys, Tardos et al. - 1997
47: Analysis of a local search heuristic for facility location problems - Korupolu, Plaxton et al. - 1998
41: Improved approximation algorithms for uncapacitated facility location - Chudak - 1998
BibTeX entry: (Update)
F. Chudak and D. Shmoys. Improved approximation algorithms for the capacitated facility location problem. Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, S875S876, 1999. http://citeseer.ist.psu.edu/chudak99improved.html More
@article{ chudak99improved,
author = "Fabi{\'a}n A. Chudak and David P. Williamson",
title = "Improved Approximation Algorithms for Capacitated Facility Location Problems",
journal = "Lecture Notes in Computer Science",
volume = "1610",
pages = "99--??",
year = "1999",
url = "citeseer.ist.psu.edu/chudak99improved.html" }
Citations (may not include all citations):271 Improved approximation algorithms for uncapacitated facility.. - Chudak - 1998
271 Improved approximation algorithms for the uncapacitated faci.. - Chudak, Shmoys
266 Greedy strikes back: improved facility location algorithms - Guha, Khuller - 1998
217 Analysis of a local search heuristic for facility location p.. - Korupolu, Plaxton et al. - 1998
217 Analysis of a local search heuristic for facility location p.. - Korupolu, Plaxton et al. - 1998
148 Approximation algorithms for facility location problems - Shmoys, Tardos et al. - 1997
148 Combinatorial Optimization: Networks and Matroids (context) - Lawler - 1976
65 Discrete Location Theory (context) - Mirchandani, Francis - 1990
39 ffl-approximation with minimum packing constraint violation (context) - Lin, Vitter - 1992
22 The uncapacitated facility location problem (context) - Cornu'ejols, Nemhauser et al. - 1990
15 Personal communication (context) - Sviridenko - 1997
13 On dependent randomized rounding algorithms (context) - Bertsimas, Teo et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cornell.edu/home/shmoys/shmoys.html): More
Cut Problems And Their Application To Divide-And-Conquer - Shmoys (1996) (Correct)
Using Linear Programming in the Design and Analysis of.. - Shmoys (1998) (Correct)
Computing Near-Optimal Solutions to Combinatorial Optimization.. - Shmoys (1995) (Correct)
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