Improved approximation algorithms for multilevel facility location problems
type: Item
instance of: scholarly article
title: Improved approximation algorithms for multilevel facility location problems
zbMATH Open document ID: 1010.90038
DOI: 10.1016/S0167-6377(02)00162-1
author: Alexander Ageev
published in: Operations Research Letters
publication date: 2003-04-02T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1891061
zbMATH Keywords: facility location
zbMATH Keywords: approximation algorithm
zbMATH Keywords: performance guarantee
zbMATH Keywords: polynomial-time reduction
MaRDI profile type: Publication
cites work: A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
cites work: Local search heuristic for k-median and facility location problems
cites work: Q4780783
cites work: Algorithms for facility location problems with outliers. (Extended abstract)
cites work: Q3840357
cites work: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
cites work: A note on two problems in connexion with graphs
cites work: Greedy Strikes Back: Improved Facility Location Algorithms
cites work: A new greedy approach for facility location problems
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Q4250157
cites work: Cost-Distance: Two Metric Network Design
cites work: Q4526991
cites work: Q4737531
cites work: Q4535022
full work available at URL: s0167-6377(02)00162-1
OpenAlex ID: W2074682523
description: scientific article; zbMATH DE number 1891061