Related references
Note: Only part of the references are listed.Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
Chenchen Wu et al.
THEORETICAL COMPUTER SCIENCE (2015)
An improved per-scenario bound for the two-stage stochastic facility location problem
Wu ChenChen et al.
SCIENCE CHINA-MATHEMATICS (2015)
A new approximation algorithm for the multilevel facility location problem
Adriana F. Gabor et al.
DISCRETE APPLIED MATHEMATICS (2010)
Approximating the two-level facility location problem via a quasi-greedy approach
Jiawei Zhang
MATHEMATICAL PROGRAMMING (2006)
The k-level facility location game
Dachuan Xu et al.
OPERATIONS RESEARCH LETTERS (2006)
Improved combinatorial approximation algorithms for the k-level facility location problem
A Ageev et al.
SIAM JOURNAL ON DISCRETE MATHEMATICS (2004)
A note on maximizing a submodular set function subject to a knapsack constraint
M Sviridenko
OPERATIONS RESEARCH LETTERS (2004)
Greedy facility location algorithms analyzed using,dual fitting with factor-revealing LP
K Jain et al.
JOURNAL OF THE ACM (2003)
Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation
K Jain et al.
JOURNAL OF THE ACM (2001)
Share Paper
