Approximation Algorithm for the Uniform Bounded Facility Problem

DOI10.1007/978-3-642-21204-8_5zbMath1329.90080OpenAlexW41808275MaRDI QIDQ3004651

Kerui Weng

Publication date: 3 June 2011

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_5

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
• An improved approximation algorithm for uncapacitated facility location problem with penalties
• The approximation gap for the metric facility location problem is not yet closed
• A threshold of ln n for approximating set cover
• Medi-centre Location Problems
• Approximation Algorithms for Metric Facility Location Problems
• Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
• Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
• Improved Combinatorial Algorithms for Facility Location Problems
• An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
• Approximation algorithms for bounded facility location problems

This page was built for publication: Approximation Algorithm for the Uniform Bounded Facility Problem