Skip to main content
Conference Proceedings

Approximation algorithms for the multilevel facility location problem with linear/submodular penalties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9130 162-169
DOI: 10.1007/978-3-319-19647-3_15
4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider two multilevel facility location problems with linear and submodular penalties respectively, and propose two approximation algorithms with performance guarantee 3 and 1+ 2/1-e-2 (≈ 3.314) for these two problems.

Author supplied keywords

Cite

CITATION STYLE

APA

Li, G., Xu, D., Du, D., & Wu, C. (2015). Approximation algorithms for the multilevel facility location problem with linear/submodular penalties. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9130, pp. 162–169). Springer Verlag. https://doi.org/10.1007/978-3-319-19647-3_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free