Approximation algorithms for the priority facility location problem with penalties
type: Item
instance of: scholarly article
title: Approximation algorithms for the priority facility location problem with penalties
zbMATH Open document ID: 1330.49034
author: Fengmin Wang
author: Dachuan Xu
author: Chenchen Wu
published in: Journal of Systems Science and Complexity
publication date: 2016-01-14T00:00:00Z
Mathematics Subject Classification ID: 49M30
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 6530238
zbMATH Keywords: priority facility location problem
zbMATH Keywords: penalties
zbMATH Keywords: primal-dual approximation algorithm
zbMATH Keywords: greedy augmentation
MaRDI profile type: Publication
full work available at URL: s11424-014-2157-2
OpenAlex ID: W2144709496
cites work: Q4526991
cites work: A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
cites work: Q4250234
cites work: Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
cites work: Improved Combinatorial Algorithms for Facility Location Problems
cites work: A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
cites work: Approximating the two-level facility location problem via a quasi-greedy approach
cites work: A new approximation algorithm for the \(k\)-facility location problem
cites work: Approximation algorithms for soft-capacitated facility location in capacitated network design
cites work: An approximation algorithm for the \(k\)-level capacitated facility location problem
cites work: A primal-dual approximation algorithm for the facility location problem with submodular penalties
cites work: Algorithms for facility location problems with outliers. (Extended abstract)
cites work: An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
cites work: An improved approximation algorithm for uncapacitated facility location problem with penalties
cites work: Network design for information networks
cites work: Q2934585
cites work: Q5501277
cites work: Approximation algorithms for the stochastic priority facility location problem
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
DOI: 10.1007/S11424-014-2157-2
Recommended article: Q3462909
Recommended article: Approximation algorithms for the stochastic priority facility location problem
Recommended article: Q3054119
Recommended article: Approximation Algorithms for the Robust Facility Location Problem with Penalties
Recommended article: Improved approximation algorithms for the facility location problems with linear/submodular penalties
Recommended article: Approximation algorithms for the fault-tolerant facility location problem with penalties
Recommended article: Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty
Recommended article: A primal-dual approximation algorithm for the facility location problem with submodular penalties
Recommended article: Q2753723
Recommended article: An improved approximation algorithm for uncapacitated facility location problem with penalties
description: scientific article; zbMATH DE number 6530238