New approximation algorithms for the unsplittable capacitated facility location problem

DOI10.1007/S00453-015-0012-ZzbMath1345.68273OpenAlexW2235001037MaRDI QIDQ300454

Zoya Svitkina, Mohammad R. Salavatipour, Babak Behsaz

Publication date: 28 June 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-015-0012-z

zbMATH Keywords

approximation algorithmscapacitated facility locationhard capacities

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (1)

Approximating Airports and Railways

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bin packing can be solved within 1+epsilon in linear time
• An approximation algorithm for the generalized assignment problem
• A 5-Approximation for Capacitated Facility Location
• A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
• Assignment problem in content distribution networks
• A 3-Approximation for Facility Location with Uniform Capacities
• A new greedy approach for facility location problems
• Local search heuristic for k-median and facility location problems
• Integer Programming and Combinatorial Optimization
• Integer Programming and Combinatorial Optimization
• Algorithms - ESA 2003
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• A tight bound on approximating arbitrary metrics by tree metrics
• An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

This page was built for publication: New approximation algorithms for the unsplittable capacitated facility location problem