The capacitated K-center problem (extended abstract)

DOI10.1007/3-540-61680-2_53zbMATH Open1379.68354OpenAlexW1627051156MaRDI QIDQ4595484FDOQ4595484

Samir Khuller, Yoram J. Sussmann

Publication date: 5 December 2017

Published in: Algorithms — ESA '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61680-2_53

Recommendations

• The Capacitated K-Center Problem
• Approximation algorithms for hard capacitated \(k\)-facility location problems
• Integer Programming and Combinatorial Optimization
• Fault tolerant \(K\)-center problems
• Constant Factor Approximation for Capacitated k-Center with Outliers

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Cited In (14)

• Computing and Combinatorics
• A \(k\)-product uncapacitated facility location problem
• Note on the applicability of the VCG mechanism to capacitated assignment problems and extensions
• Capacitated center problems with two-sided bounds and outliers
• Approximation algorithms for the \(k\)-center problem: an experimental evaluation
• Fault tolerant \(K\)-center problems
• \(k\)-center problems with minimum coverage
• Constant Factor Approximation for Capacitated k-Center with Outliers
• Facility location with dynamic distance functions
• An exact algorithm for the capacitated vertex \(p\)-center problem
• Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier
• Integer Programming and Combinatorial Optimization
• Solving \(k\)-center problems involving sets based on optimization techniques
• The Capacitated K-Center Problem

This page was built for publication: The capacitated \(K\)-center problem (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595484)