Centrality of Trees for Capacitated k-Center

DOI10.1007/978-3-319-07557-0_5zbMath1333.90067OpenAlexW2792638073MaRDI QIDQ5418984

Ola Svensson, Shalmoli Gupta, Aditya Bhaskara, Chandra Chekuri, Hyung-Chan An, Vivek Madan

Publication date: 2 June 2014

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07557-0_5

zbMATH Keywords

approximation algorithmscapacitated \(k\)-center problemcapacitated network location problemsLP-rounding algorithms

Mathematics Subject Classification ID

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

Related Items

Centrality of trees for capacitated \(k\)-center ⋮ A theory and algorithms for combinatorial reoptimization ⋮ The fault-tolerant capacitated \(K\)-center problem ⋮ A unified framework for clustering constrained data without locality property ⋮ Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints