A General k-Level Uncapacitated Facility Location Problem

DOI10.1007/978-3-540-85930-7_11zbMath1173.90445OpenAlexW1528820013MaRDI QIDQ3602009

Rongheng Li, Huei-Chuen Huang

Publication date: 12 February 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85930-7_11

zbMATH Keywords

complexityapproximation algorithmfacility locationk-level

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
• Approximating the two-level facility location problem via a quasi-greedy approach
• A new greedy approach for facility location problems
• Greedy Strikes Back: Improved Facility Location Algorithms
• Improved Approximation Algorithms for the Uncapacitated Facility Location Problem

This page was built for publication: A General k-Level Uncapacitated Facility Location Problem