C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
A combinatorial 2.375-approximation algorithm for the facility location problem with submodular penalties.
Yu Li
Donglei Du
Naihua Xiu
Dachuan Xu
Published in:
Theor. Comput. Sci. (2013)
Keyphrases
</>
submodular functions
dominating set
dynamic programming
worst case
np hard
facility location problem
combinatorial optimization
greedy algorithm
optimal solution
upper bound
linear programming
expectation maximization
energy function
distributed databases
multi period