Facility Location Approximation is an approximation algorithm designed to solve facility location problems by efficiently computing a near-optimal solution that minimizes the total cost of opening facilities and connecting clients to them, within a provable performance guarantee relative to the optimal solution.
415
Publications
26.3K
Citations
687
Authors
384
Institutions
Publications per year
2017–2026
69
Parents
Publications
415
Local Search Heuristics for <i>k</i>-Median and Facility Location Problems
Vijay Arya, Naveen Garg, Rohit Khandekar et al. · SIAM Journal on Computing · 2004 · 544 citations
Greedy strikes back: Improved Facility Location Algorithms
1998 · 526 citations
1–5 of 415
Authors
687
- DB
10
h-index
- ZD
10
h-index
- DX
10
h-index
- AM
9
h-index
- CS
9
h-index
1–5 of 687
Institutions
384
Stanford University
Stanford, United States
16 h-index
24 publications
3.5K citations
Cornell University
Ithaca, United States
15 h-index
28 publications
3.5K citations
Carnegie Mellon University
Pittsburgh, United States
13 h-index
21 publications
1.7K citations
Centre National de la Recherche Scientifique
Paris, France
9 h-index
12 publications
379 citations
Beijing University of Technology
Beijing, China
9 h-index
15 publications
393 citations
Tel Aviv University
Tel Aviv, Israel
9 h-index
14 publications
1.1K citations
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
13 publications
1.6K citations
HEC Montréal
Montreal, Canada
9 h-index
11 publications
868 citations
1–8 of 384
Venues
- European Journal of Operational Research
47 publications · 3.6K citations
34
h-index
- Computers & Operations Research
23 publications · 1.1K citations
19
h-index
- Operations Research Letters
14 publications · 691 citations
13
h-index
- ACM Transactions on Algorithms
TALG · 13 publications · 398 citations
12
h-index
- Journal of the Operational Research Society
OR · 12 publications · 547 citations
11
h-index
1–5