Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
type: Item
instance of: scholarly article
title: Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
zbMATH Open document ID: 1303.68158
published in: Theoretical Computer Science
publication date: 2014-12-02T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6375979
zbMATH Keywords: facility location problem
zbMATH Keywords: approximation algorithm
zbMATH Keywords: primal-dual algorithm
author: Chenchen Wu
author: Donglei Du
author: Dachuan Xu
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.09.045
OpenAlex ID: W1991566967
cites work: A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
cites work: Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
cites work: Q4780783
cites work: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
cites work: Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location
cites work: Improved Combinatorial Algorithms for Facility Location Problems
cites work: Algorithms for facility location problems with outliers. (Extended abstract)
cites work: Approximation algorithms for soft-capacitated facility location in capacitated network design
cites work: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
cites work: A new approximation algorithm for the multilevel facility location problem
cites work: Geometric algorithms and combinatorial optimization
cites work: Greedy Strikes Back: Improved Facility Location Algorithms
cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Q5743432
cites work: A 1.488 approximation algorithm for the uncapacitated facility location problem
cites work: Approximation Algorithms for Metric Facility Location Problems
cites work: Hedging uncertainty: approximation algorithms for stochastic optimization problems
cites work: Q4526991
cites work: Stochastic Transportation-Inventory Network Design Problem
cites work: Q4737531
cites work: A note on maximizing a submodular set function subject to a knapsack constraint
cites work: An approximation algorithm for the \(k\)-level stochastic facility location problem
cites work: Q5494208
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: A note on the maximization version of the multi-level facility location problem
cites work: A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
DOI: 10.1016/J.TCS.2014.09.045
description: scientific article; zbMATH DE number 6375979